Abstract
LetGbe a uniquely hamiltonian graph onnvertices. We show thatGhas a vertex of degree at mostclog28n+3, wherec=(2-log23)-1≈2.41. We show further thatGhas at least two vertices of degree less than four if it is planar and at least four vertices of degree two if it is bipartite. © 1998 Academic Press.
Cite
CITATION STYLE
APA
Bondy, J. A., & Jackson, B. (1998). Vertices of Small Degree in Uniquely Hamiltonian Graphs. Journal of Combinatorial Theory. Series B, 74(2), 265–275. https://doi.org/10.1006/jctb.1998.1845
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free