Hamiltonicity and minimum degree in 3-connected claw-free graphs

DOI10.1006/jctb.2001.2039zbMath1024.05056OpenAlexW1992542849MaRDI QIDQ1850548

Pierre Fraisse, Odile Favaron

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2039

zbMATH Keywords

Hamiltonianclaw

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Hamiltonian line graphs with local degree conditions ⋮ Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs ⋮ Hamiltonian claw-free graphs involving minimum degrees ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Hamiltonicity in 3-connected claw-free graphs ⋮ Circumferences and minimum degrees in 3-connected claw-free graphs ⋮ Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

Cites Work

• When m vertices in a k-connected graph cannot be walked round along a simple cycle
• A nine point theorem for 3-connected graphs
• On a closure concept in claw-free graphs
• Hamiltonian results inK1,3-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Hamiltonicity and minimum degree in 3-connected claw-free graphs