The \(*\)-closure for graphs and claw-free graphs

DOI10.1016/j.disc.2007.10.023zbMath1186.05076OpenAlexW2048853220MaRDI QIDQ998440

Roman Čada

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.023

zbMATH Keywords

clawtraceabilitylocal structurehamiltonicityclosure concept

Mathematics Subject Classification ID

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

Related Items

A twelve vertex theorem for 3-connected claw-free graphs ⋮ A note on degree conditions for traceability in locally claw-free graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

Cites Work

• Unnamed Item
• Degree conditions on induced claws
• Closure and Hamiltonian-connectivity of claw-free graphs
• 9-connected claw-free graphs are Hamilton-connected
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• On a closure concept in claw-free graphs
• Closure concepts for claw-free graphs
• Closure and stable Hamiltonian properties in claw-free graphs
• Strengthening the closure concept in claw-free graphs