Every 3-connected essentially 10-connected line graph is Hamilton-connected

DOI10.1016/j.disc.2012.08.015zbMath1254.05167OpenAlexW2023068030MaRDI QIDQ1759410

Hao Li, Weihua Yang

Publication date: 20 November 2012

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

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

zbMATH Keywords

Hamiltonian line graphsuper-Eulerian graphedge-disjoint spanning tree

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Hamiltonian cycles in spanning subgraphs of line graphs ⋮ Hamiltonian paths in spanning subgraphs of line graphs ⋮ The Hamiltonicity of essentially 9‐connected line graphs ⋮ Spanning tree packing and 2-essential edge-connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Collapsible graphs and Hamiltonian connectedness of line graphs
• Hamiltonicity of 3-connected line graphs
• On hamiltonian line graphs and connectivity
• On computing a conditional edge-connectivity of a graph
• On a closure concept in claw-free graphs
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Reflections on graph theory

This page was built for publication: Every 3-connected essentially 10-connected line graph is Hamilton-connected