On Hamiltonicity of \{claw, net\}-free graphs

DOI10.1016/j.disc.2006.04.022zbMath1106.05055arXivmath/0607234OpenAlexW2055925267MaRDI QIDQ2433732

Alexander K. Kelmans

Publication date: 30 October 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0607234

zbMATH Keywords

Hamiltonian cycleHamiltonian pathpolynomial-time algorithms\(CN\)-free graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

On independent vertex sets in subclasses of apple-free graphs ⋮ On Hamiltonicity of \{claw, net\}-free graphs ⋮ On distance-3 matchings and induced matchings ⋮ On Distance-3 Matchings and Induced Matchings

Cites Work

• Unnamed Item
• Unnamed Item
• The struction of a graph: Application to CN-free graphs
• Hamiltonicity in claw-free graphs
• Claw-free graphs---a survey
• On a closure concept in claw-free graphs
• On graph closures
• On Hamiltonicity of \{claw, net\}-free graphs
• Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs

This page was built for publication: On Hamiltonicity of \{claw, net\}-free graphs