Hamiltonicity of 3-connected line graphs
From MaRDI portal
Publication:712614
DOI10.1016/j.aml.2012.02.032zbMath1251.05094MaRDI 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
Hamiltonian graph; line graph; super-Eulerian graphs; collapsible graph; dominating Eulerian subgraph; Thomassen's conjecture
Related Items
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
- Unnamed Item
- Unnamed Item
- 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