An implicit degree condition for long cycles in 2-connected graphs
From MaRDI portal
Publication:1031703
DOI10.1016/j.aml.2005.12.006zbMath1172.05329OpenAlexW2072516474MaRDI QIDQ1031703
Publication date: 30 October 2009
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2005.12.006
Related Items (8)
Minimum implicit degree condition restricted to claws for Hamiltonian cycles ⋮ An implicit degree condition for pancyclicity of graphs ⋮ An implicit degree sum condition for cycles through specified vertices ⋮ An implicit degree Ore-condition for pancyclicity of graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ A sufficient condition involving implicit degree and neighborhood intersection for long cycles ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
Cites Work
This page was built for publication: An implicit degree condition for long cycles in 2-connected graphs