Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected

DOI10.1016/j.disc.2007.09.045zbMath1189.05096OpenAlexW2100959688MaRDI QIDQ2519848

Yehong Shao, Hong-Jian Lai, Mingquan Zhan

Publication date: 27 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.045

zbMATH Keywords

line graphcollapsible graphquasi claw-free graphHamiltonian connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

A note on edge-disjoint Hamilton cycles in line graphs ⋮ On the \(s\)-hamiltonianicity of an hourglass-free line graph ⋮ Hamilton cycles in 5-connected line graphs ⋮ On 3-connected Hamiltonian line graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ How many conjectures can you stand? A survey ⋮ Panconnected index of graphs ⋮ The spanning connectivity of line graphs

Cites Work

• On hamiltonian line graphs and connectivity
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• Every 4-connected line graph of a planar graph is Hamiltonian
• On a closure concept in claw-free graphs
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Hamiltonian results inK1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected