Vertices of Small Degree in Uniquely Hamiltonian Graphs

Autor: Bondy, J.A., Jackson, Bill
Zdroj: Journal of Combinatorial Theory - Series B; November 1998, Vol. 74 Issue: 2 p265-275, 11p
Abstrakt: 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.
Databáze: Supplemental Index