Hamilton cycles in 6-connected claw-free graphs (extended abstract)
From MaRDI portal
Recommendations
Cites work
- A short proof of the tree-packing theorem
- A Theorem on Planar Graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Hamiltonian results inK1,3-free graphs
- On a closure concept in claw-free graphs
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On hamiltonian line graphs and connectivity
- On the Problem of Decomposing a Graph into n Connected Factors
- Reflections on graph theory
Cited in
(10)- Hamilton paths and cycles in vertex-transitive graphs of order 6p
- A note on the shortness coefficient and the Hamiltonicity of 4-connected line graphs
- On the extended Clark-Wormold Hamiltonian-like index problem
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- Equivalence of Jackson's and Thomassen's conjectures
- On factors of 4-connected claw-free graphs
- Hamilton cycles in 5-connected line graphs
- scientific article; zbMATH DE number 637341 (Why is no real title available?)
- Hamilton connectivity of line graphs and claw‐free graphs
- Hamiltonicity of 6-connected line graphs
This page was built for publication: Hamilton cycles in 6-connected claw-free graphs (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851482)