Hamilton cycles in 5-connected line graphs

Authors:
Tomáš Kaiser;Petr Vrána
Affiliations:
-;-
Venue:
European Journal of Combinatorics
Year:
2012

Citing 13
Cited 2

On Hamiltonian line graphs and connectivity

Discrete Mathematics
On a closure concept in claw-free graphs

Journal of Combinatorial Theory Series B
Equivalence of Fleischner's and Thomassen's conjectures

Journal of Combinatorial Theory Series B
Edge-disjoint trees containing some given vertices in a graph

Journal of Combinatorial Theory Series B
On decomposing a hypergraph into k connected sub-hypergraphs

Discrete Applied Mathematics - Submodularity
Eulerian subgraphs and Hamilton-connected line graphs

Discrete Applied Mathematics
Every 3-connected, essentially 11-connected line graph is Hamiltonian

Journal of Combinatorial Theory Series B
Indecomposable r-graphs and some other counterexamples

Journal of Graph Theory
Hamilton connectivity of line graphs and claw-free graphs

Journal of Graph Theory
Cycles Intersecting Edge-Cuts of Prescribed Sizes

SIAM Journal on Discrete Mathematics
Edge disjoint Steiner trees in graphs without large bridges

Journal of Graph Theory
Note: Hamiltonicity of 6-connected line graphs

Discrete Applied Mathematics
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs

Journal of Graph Theory

Collapsible graphs and Hamiltonian connectedness of line graphs

Discrete Applied Mathematics
Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

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.