Hamilton cycles in 5-connected line graphs
From MaRDI portal
Publication:412285
DOI10.1016/j.ejc.2011.09.015zbMath1239.05113arXiv1009.3754MaRDI QIDQ412285
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.3754
Related Items
A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs, Chvátal’s t 0-Tough Conjecture, Hamiltonian cycles in spanning subgraphs of line graphs, Circumferences of 2-factors in claw-free graphs, On 1-Hamilton-connected claw-free graphs, A short proof of the tree-packing theorem, Collapsible graphs and Hamiltonian connectedness of line graphs, How many conjectures can you stand? A survey, Hamiltonicity of 3-connected line graphs, Collapsible graphs and Hamiltonicity of line graphs, Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs, Depth first search in claw-free graphs, Spanning trails in a 2-connected graph, Equivalence of Jackson's and Thomassen's conjectures, Hamiltonian paths in spanning subgraphs of line graphs, Recent advances on the Hamiltonian problem: survey III, 2-factors with bounded number of components in claw-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonicity of 6-connected line graphs
- On hamiltonian line graphs and connectivity
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- On a closure concept in claw-free graphs
- Edge-disjoint trees containing some given vertices in a graph
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- Equivalence of Fleischner's and Thomassen's conjectures
- Eulerian subgraphs and Hamilton-connected line 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
- Line graphs of multigraphs and Hamilton-connectedness of claw-free 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
- Cycles Intersecting Edge-Cuts of Prescribed Sizes
- Edge disjoint Steiner trees in graphs without large bridges
- Reflections on graph theory
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Hamilton connectivity of line graphs and claw‐free graphs
