Hamiltonicity in Partly claw-free graphs

DOI10.1051/ro/2009007zbMath1158.05324OpenAlexW2091256003MaRDI QIDQ3621979

Zineb Benmeziane, Moncef Abbas

Publication date: 23 April 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105418

zbMATH Keywords

matchinggraph theoryclaw-free graphsalmost claw-free graphshamiltonicity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Perfect matchings and \(K_{1,p}\)-restricted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Long cycles in graphs with large degree sums
• Hamilton connected graphs
• Claw-free graphs---a survey
• On a closure concept in claw-free graphs
• Hamiltonicity in 2-connected graphs with claws
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• Longest paths and cycles in K1,3-free graphs
• Hamilton cycles in claw-free graphs
• Existence of Δλ-cycles and Δλ-paths
• Graphs with 1-Factors
• 1-Factors and Antifactor Sets
• Almost claw‐free graphs
• Reflections on graph theory
• Toughness and hamiltonicity in almost claw-free graphs