Hamilton cycles in 6-connected claw-free graphs (Extended abstract)

DOI10.1016/j.endm.2009.07.052zbMath1273.05130OpenAlexW2016151684MaRDI QIDQ2851482

Petr Vrána, Tomáš Kaiser

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.052

zbMATH Keywords

connectivityclaw-free graphline graphHamilton cycle

Mathematics Subject Classification ID

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

Cites Work

• A short proof of the tree-packing theorem
• On hamiltonian line graphs and connectivity
• On a closure concept in claw-free graphs
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• A Theorem on Planar Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Hamiltonian results inK1,3-free graphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Hamilton cycles in 6-connected claw-free graphs (Extended abstract)