All 4-connected line graphs of claw free graphs are Hamiltonian connected

DOI10.1006/jctb.2001.2040zbMath1027.05059OpenAlexW2022750713MaRDI QIDQ1850549

Matthias Kriesell

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2040

zbMATH Keywords

Eulerian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamilton-connectivity of line graphs with application to their detour index ⋮ On the \(s\)-hamiltonianicity of an hourglass-free line graph ⋮ On 3-connected Hamiltonian line graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ How many conjectures can you stand? A survey ⋮ The spanning connectivity of line graphs ⋮ What is on his mind? ⋮ Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected ⋮ Hamiltonian connectedness in 3-connected line graphs ⋮ Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs ⋮ On the extended Clark-Wormold Hamiltonian-like index problem ⋮ On \(s\)-Hamiltonian line graphs of claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles through four edges in 3-connected cubic graphs
• On hamiltonian line graphs and connectivity
• On \(k\)-critical connected line graphs
• Flows and generalized coloring theorems in graphs
• Every 4-connected line graph of a planar graph is Hamiltonian
• On a closure concept in claw-free graphs
• On factors of 4-connected 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
• Reflections on graph theory
• The interchange graph of a finite graph