Hamiltonicity of 3-connected line graphs

DOI10.1016/J.AML.2012.02.032zbMath1251.05094OpenAlexW2146602640MaRDI QIDQ712614

Weihua Yang, Xiaofeng Guo, Hong-Jian Lai, Limning Xiong

Publication date: 17 October 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2012.02.032

zbMATH Keywords

Hamiltonian graphline graphsuper-Eulerian graphscollapsible graphdominating Eulerian subgraphThomassen's conjecture

Mathematics Subject Classification ID

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

Related Items (3)

The Hamiltonicity of essentially 9‐connected line graphs ⋮ Collapsible graphs and Hamiltonian connectedness of line graphs ⋮ Every 3-connected essentially 10-connected line graph is Hamilton-connected

Cites Work

• Hamilton cycles in 5-connected line graphs
• On hamiltonian line graphs and connectivity
• Graphs without spanning closed trails
• On a closure concept in claw-free graphs
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• On factors of 4-connected claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Reflections on graph theory
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonicity of 3-connected line graphs