Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs

DOI10.1007/s00186-008-0263-4zbMath1161.05332OpenAlexW1996887679MaRDI QIDQ5901555

Jinfeng Feng

Publication date: 27 April 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-008-0263-4

zbMATH Keywords

distanceHamiltonian cycleclawinduced cycledominating cycleinduced path

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• New sufficient conditions for cycles in graphs
• Hamiltonian problem on claw-free and almost distance-hereditary graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Dirac's minimum degree condition restricted to claws
• Claw-free graphs---a survey
• Advances on the Hamiltonian problem -- a survey
• An efficient condition for a graph to be Hamiltonian
• Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs
• Note on Hamilton Circuits
• 2‐neighborhoods and hamiltonian conditions

This page was built for publication: Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs