Hamiltonian cycles in spanning subgraphs of line graphs

DOI10.1016/j.dam.2015.07.040zbMath1339.05217OpenAlexW2166186704MaRDI QIDQ298990

Weihua Yang, Hao Li, Wei-Hua He, Yan Dong Bai

Publication date: 21 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.040

zbMATH Keywords

Hamiltonian cycleline graphspanning subgraph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Hamiltonian paths in spanning subgraphs of line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Hamilton cycles in 5-connected line graphs
• Collapsible graphs and Hamiltonian connectedness of line graphs
• On hamiltonian line graphs and connectivity
• On a closure concept in claw-free graphs
• Every 3-connected essentially 10-connected line graph is Hamilton-connected
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Hamiltonian results inK1,3-free graphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Hamiltonian cycles in spanning subgraphs of line graphs