Toughness and hamiltonicity in almost claw-free graphs

DOI<431::AID-JGT9>3.0.CO;2-Q 10.1002/(SICI)1097-0118(199604)21:4<431::AID-JGT9>3.0.CO;2-QzbMath0847.05069OpenAlexW4213090047MaRDI QIDQ4879180

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

Publication date: 29 September 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199604)21:4<431::aid-jgt9>3.0.co;2-q

zbMATH Keywords

independent setclaw-free graphindependent setstoughnesshamiltonicity

Mathematics Subject Classification ID

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

Related Items (11)

Claw-free graphs---a survey ⋮ Hamiltonicity of 2-connected claw-center independent graphs ⋮ \(D_ \lambda\)-cycles in 3-cyclable graphs ⋮ Quasi-claw-free graphs ⋮ Hamiltonicity in 2-connected graphs with claws ⋮ Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ Hamiltonicity in Partly claw-free graphs ⋮ On hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Global insertion and Hamiltonicity in DCT-graphs

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