Login / Signup
The minimum size of graphs hamiltonian-connected from a vertex.
C. J. Knickerbocker
Patti Frazer Lock
Michael Sheard
Published in:
Discret. Math. (1989)
Keyphrases
</>
undirected graph
directed graph
spanning tree
uniform random
labeled graphs
graph theory
minimum cost
graph matching
attributed graphs
connected components
hamiltonian cycle
graph structure
weighted graph
graph theoretic
strongly connected
maximum clique
connected subgraphs
computational complexity