Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†

DOI10.1080/02331930701778981MaRDI QIDQ5449017zbMATH OpenOpenAlexFDO

Authors Jinfeng Feng, Yubao Guo

Publication date 10 March 2008

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930701778981

zbMATH Keywords

Hamiltonian cycleinduced subgraphclawdistance-hereditarydegree condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Hamiltonian problem on claw-free and almost distance-hereditary graphs
• Hamilton cycles in almost distance-hereditary graphs
• Minimum implicit degree condition restricted to claws for Hamiltonian cycles
• Hamilton cycles in claw-heavy graphs
• Hamiltonian cycles in almost claw-free graphs

Cites work

• 2‐neighborhoods and hamiltonian conditions
• A method in graph theory
• Almost distance-hereditary graphs
• Cycles through specified vertices
• Dirac's minimum degree condition restricted to claws

Cited in

(3)

• Hamiltonian problem on claw-free and almost distance-hereditary graphs
• Minimum implicit degree condition restricted to claws for Hamiltonian cycles
• Hamilton cycles in almost distance-hereditary graphs

This page was built for publication: Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449017)