Toughness and hamiltonicity in almost claw-free graphs

DOI10.1002/(SICI)1097-0118(199604)21:4%3C431::AID-JGT9%3E3.0.CO;2-QMaRDI QIDQ4879180zbMATH OpenOpenAlexFDO

Authors Zdeněk Ryjáček, Hajo Broersma, Ingo Schiermeyer

Publication date 29 September 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199604)21:4%3C431::aid-jgt9%3E3.0.co;2-q

zbMATH Keywords

claw-free graphhamiltonicityindependent setindependent setstoughness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonian cycles in almost claw-free graphs
• Hamiltonicity in Partly claw-free graphs
• Publication:3491603
• Hamiltonian properties of almost locally connected claw-free graphs.
• Neighborhood intersections and Hamiltonicity in almost claw-free graphs

Cited in

(16)

• On hamiltonicity of \(P_{3}\)-dominated graphs
• Claw-free graphs---a survey
• Hamiltonicity of 2-connected claw-center independent graphs
• Quasi-claw-free graphs
• Hamiltonicity in 2-connected graphs with claws
• Global insertion and Hamiltonicity in DCT-graphs
• \(D_ \lambda\)-cycles in 3-cyclable graphs
• Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• Hamiltonicity in Partly claw-free graphs
• Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs
• On hamiltonicity of 1-tough triangle-free graphs
• Hamiltonian cycles in almost claw-free graphs
• A Fan-type condition for cycles in 1-tough and k-connected (P₂ kP₁)-free graphs
• Path factors and parallel knock-out schemes of almost claw-free graphs
• Hamiltonian problem on claw-free and almost distance-hereditary graphs

This page was built for publication: Toughness and hamiltonicity in almost claw-free graphs

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