Collapsible graphs and Hamiltonian connectedness of line graphs

DOI10.1016/J.DAM.2012.03.028MaRDI QIDQ444449zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

line graphcollapsible graphedge connectivitydominating Eulerian subgraphHamiltonian line graphsuper-Eulerian graphThomassen's conjecture

Mathematics Subject Classification ID

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

Recommendations

• Collapsible graphs and Hamiltonicity of line graphs
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Hamilton cycles in 5-connected line graphs
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Hamiltonicity of 3-connected line graphs

Cites work

• A reduction method to find spanning Eulerian subgraphs
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Graph theory
• Graphs without spanning closed trails
• Hamilton connectivity of line graphs and claw‐free graphs
• Hamilton cycles in 5-connected line graphs
• Hamiltonian connectedness in 3-connected line graphs
• Hamiltonian results inK1,3-free graphs
• Hamiltonicity of 3-connected line graphs
• Hamiltonicity of 6-connected line graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• On a closure concept in claw-free graphs
• On computing a conditional edge-connectivity of a graph
• On hamiltonian line graphs and connectivity
• Reflections on graph theory

Cited in

(8)

• Spanning tree packing and 2-essential edge-connectivity
• Collapsible graphs and Hamilton cycles of line graphs
• The Hamiltonicity of essentially 9‐connected line graphs
• Every 3-connected essentially 10-connected line graph is Hamilton-connected
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Catlin's reduced graphs with small orders
• Collapsible graphs and Hamiltonicity of line graphs
• Hamiltonian cycles in spanning subgraphs of line graphs

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)