Introduction to algorithms
Small cycles in Hamiltonian graphs
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Another cycle structure theorem for hamiltonian graphs
Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A new sufficient condition for Hamiltonicity of graphs
Information Processing Letters
An improved degree based condition for Hamiltonian cycles
Information Processing Letters
A sufficient condition for pancyclic graphs
Information Processing Letters
Note: A comprehensive analysis of degree based condition for Hamiltonian cycles
Theoretical Computer Science
Hi-index | 0.89 |
A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths. The significance of the theorems is discussed, and it is shown that the famous Ore's theorem directly follows from our result.