Hamilton cycles in 5-connected line graphs
From MaRDI portal
Publication:412285
DOI10.1016/J.EJC.2011.09.015zbMATH Open1239.05113arXiv1009.3754OpenAlexW2014937299MaRDI QIDQ412285FDOQ412285
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.
Full work available at URL: https://arxiv.org/abs/1009.3754
Cites Work
- On a closure concept in claw-free graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Title not available (Why is that?)
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Edge-disjoint trees containing some given vertices in a graph
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- Hamiltonian results inK1,3-free graphs
- Cycles Intersecting Edge-Cuts of Prescribed Sizes
- Eulerian subgraphs and Hamilton-connected line graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- Reflections on graph theory
- On hamiltonian line graphs and connectivity
- Edge disjoint Steiner trees in graphs without large bridges
- Title not available (Why is that?)
- Equivalence of Fleischner's and Thomassen's conjectures
- Title not available (Why is that?)
- Indecomposabler-graphs and some other counterexamples
- Hamilton connectivity of line graphs and claw‐free graphs
- Hamiltonicity of 6-connected line graphs
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
Cited In (34)
- On 1-Hamilton-connected claw-free graphs
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
- How many conjectures can you stand? A survey
- A contribution to a conjecture of A. Saito
- Recent advances on the Hamiltonian problem: survey III
- On the line graph of a graph with diameter 2
- A short proof of the tree-packing theorem
- 2-factors with bounded number of components in claw-free graphs
- On \(s\)-Hamiltonicity of net-free line graphs
- Depth first search in claw-free graphs
- Hamiltonian cycles in spanning subgraphs of line graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Collapsible graphs and Hamiltonian connectedness of line graphs
- On the \(s\)-hamiltonianicity of an hourglass-free line graph
- On Hamiltonicity of regular graphs with bounded second neighborhoods
- Hamiltonicity of 3-connected line graphs
- Compatible spanning circuits and forbidden induced subgraphs
- A note on the shortness coefficient and the Hamiltonicity of 4-connected line graphs
- On 2-factors with a specified number of components in line graphs
- The Hamiltonicity of essentially 9‐connected line graphs
- Title not available (Why is that?)
- Chvátal’s t 0-Tough Conjecture
- Equivalence of Jackson's and Thomassen's conjectures
- Hamilton cycles in line graphs of 3-hypergraphs
- Classification of Hamiltonian cycles of a 3-connected graph which contain five contractible edges
- On the extended Clark-Wormold Hamiltonian-like index problem
- Hamiltonian paths in spanning subgraphs of line graphs
- Collapsible graphs and Hamiltonicity of line graphs
- Title not available (Why is that?)
- Spanning trails in a 2-connected graph
- Quasigraphs and skeletal partitions
- Circumferences of 2-factors in claw-free graphs
- 5-Connected Toroidal Graphs are Hamiltonian-Connected
- Spanning tree packing and 2-essential edge-connectivity
This page was built for publication: Hamilton cycles in 5-connected line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412285)
