Abstract
A theorem is proved that is, in a sense to be made precise, the best possible generalization of the theorems of Dirac, Pósa, and Bondy that give successively weaker sufficient conditions for a graph to be Hamiltonian. Some simple corollaries are deduced concerning Hamiltonian paths, n-Hamiltonian graphs, and Hamiltonian bipartite graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
