Hamiltonian cycles in spanning subgraphs of line graphs
From MaRDI portal
Publication:298990
DOI10.1016/j.dam.2015.07.040zbMath1339.05217MaRDI 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
05C45: Eulerian and Hamiltonian graphs
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
05C76: Graph operations (line graphs, products, etc.)
Related Items
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