Collapsible graphs and Hamiltonian connectedness of line graphs
From MaRDI portal
Publication:444449
DOI10.1016/j.dam.2012.03.028zbMath1245.05078MaRDI QIDQ444449
Hong-Jian Lai, Xiaofeng Guo, Weihua Yang, Hao Li
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.028
line graph; collapsible graph; edge connectivity; Hamiltonian line graph; super-Eulerian graph; dominating Eulerian subgraph; Thomassen's conjecture
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
05C76: Graph operations (line graphs, products, etc.)
Related Items
Catlin’s reduced graphs with small orders, The Hamiltonicity of essentially 9‐connected line graphs, Hamiltonian cycles in spanning subgraphs of line graphs, Collapsible graphs and Hamilton cycles of line graphs, Every 3-connected essentially 10-connected line graph is Hamilton-connected, Spanning tree packing and 2-essential edge-connectivity
Cites Work
- Unnamed Item
- Hamilton cycles in 5-connected line graphs
- Hamiltonicity of 6-connected line graphs
- Hamiltonicity of 3-connected line graphs
- On hamiltonian line graphs and connectivity
- Hamiltonian connectedness in 3-connected line graphs
- On computing a conditional edge-connectivity of a graph
- Graphs without spanning closed trails
- On a closure concept in claw-free graphs
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Hamiltonian results inK1,3-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Reflections on graph theory
- Hamilton connectivity of line graphs and claw‐free graphs