Collapsible graphs and Hamiltonicity of line graphs

DOI10.1007/S00373-012-1280-XzbMath1298.05195OpenAlexW2147024679MaRDI QIDQ742590

Weihua Yang, Xiaofeng Guo, Hao Li, Hong-Jian Lai

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1280-x

zbMATH Keywords

Hamiltonian graphline graphcollapsible graphsupereulerian graphdominating Eulerian subgraphThomassen's conjecture

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Collapsible graphs and Hamilton cycles of line graphs ⋮ Collapsible graphs and Hamiltonicity of line graphs

Cites Work

• Hamilton cycles in 5-connected line graphs
• Hamiltonicity of 6-connected line graphs
• Collapsible graphs and Hamiltonicity of 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
• A method in graph theory
• On a closure concept in claw-free graphs
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• 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

This page was built for publication: Collapsible graphs and Hamiltonicity of line graphs