Sign in
Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph.
Shunsuke Nakamura
Yoshimi Egawa
Keiko Kotani
Published in:
Electron. Notes Discret. Math. (2018)
Keyphrases
</>
constant factor
lower bound
upper bound
directed graph
undirected graph
branch and bound algorithm
edge weights
optimal solution
weighted graph
objective function
vertex set
spanning tree
scheduling problem
directed edges
image structure
directed acyclic graph
small number
randomized algorithm