On Hamiltonian cycles and Hamiltonian paths

DOI10.1016/j.ipl.2004.12.002zbMath1182.68142OpenAlexW2078431586WikidataQ56209814 ScholiaQ56209814MaRDI QIDQ1041720

Mohammad Kaykobad, M. Sohel Rahman

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.002

zbMATH Keywords

combinatorial problemsgraphsHamiltonian cycleHamiltonian path

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

On one extension of Dirac's theorem on Hamiltonicity ⋮ Two types of path structures of graphs ⋮ A new sufficient condition for hamiltonicity of graphs ⋮ An improved degree based condition for Hamiltonian cycles ⋮ A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole ⋮ Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time ⋮ A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes ⋮ Hamiltonian paths in some classes of grid graphs ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ A sufficient condition for pancyclic graphs ⋮ Hamiltonian paths in \(L\)-shaped grid graphs ⋮ Emergency relief routing models for injured victims considering equity and priority ⋮ Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs ⋮ A comprehensive analysis of degree based condition for Hamiltonian cycles ⋮ Hamiltonian walks on the Sierpinski gasket

Cites Work

• Unnamed Item
• Unnamed Item
• A method in graph theory
• Another cycle structure theorem for Hamiltonian graphs
• Small cycles in Hamiltonian graphs
• One criterion of existence of a Hamiltonian cycle
• Hamilton cycles and eigenvalues of graphs
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs