Hamiltonicity in connected regular graphs
Combinatorics
2015-08-06 v1
Abstract
In 1980, Jackson proved that every 2-connected -regular graph with at most vertices is Hamiltonian. This result has been extended in several papers. In this note, we determine the minimum number of vertices in a connected -regular graph that is not Hamiltonian, and we also solve the analogous problem for Hamiltonian paths. Further, we characterize the smallest connected -regular graphs without a Hamiltonian cycle.
Cite
@article{arxiv.1204.6457,
title = {Hamiltonicity in connected regular graphs},
author = {Daniel W. Cranston and Suil O},
journal= {arXiv preprint arXiv:1204.6457},
year = {2015}
}
Comments
5 pages