On Hamiltonian cycles and Hamiltonian paths
From MaRDI portal
Publication:1041720
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
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (18)
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 ⋮ The longest path problem in odd-sized \(O\)-shaped grid graphs ⋮ A sufficient condition for pancyclic graphs ⋮ Hamiltonian paths in \(L\)-shaped grid graphs ⋮ Emergency relief routing models for injured victims considering equity and priority ⋮ Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\) ⋮ Implicit degree condition restricted to essential independent sets for Hamiltonian cycles ⋮ 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
This page was built for publication: On Hamiltonian cycles and Hamiltonian paths
