Collapsible graphs and Hamiltonian connectedness of line graphs
DOI10.1016/J.DAM.2012.03.028zbMATH Open1245.05078OpenAlexW2167075033MaRDI QIDQ444449FDOQ444449
Authors: Weihua Yang, Hong-Jian Lai, Xiaofeng Guo, 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
Recommendations
line graphcollapsible graphedge connectivitydominating Eulerian subgraphHamiltonian line graphsuper-Eulerian graphThomassen's conjecture
Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph theory
- Graphs without spanning closed trails
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- On computing a conditional edge-connectivity of a graph
- Hamiltonian results inK1,3-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Hamiltonian connectedness in 3-connected line graphs
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Hamilton cycles in 5-connected line graphs
- Reflections on graph theory
- On hamiltonian line graphs and connectivity
- Hamilton connectivity of line graphs and claw‐free graphs
- Hamiltonicity of 6-connected line graphs
- Hamiltonicity of 3-connected line graphs
Cited In (7)
- Hamiltonian cycles in spanning subgraphs of line graphs
- The Hamiltonicity of essentially 9‐connected line graphs
- Every 3-connected essentially 10-connected line graph is Hamilton-connected
- Catlin’s reduced graphs with small orders
- Collapsible graphs and Hamilton cycles of line graphs
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Spanning tree packing and 2-essential edge-connectivity
This page was built for publication: Collapsible graphs and Hamiltonian connectedness of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444449)
