Hamiltonian paths in spanning subgraphs of line graphs
From MaRDI portal
Publication:2400567
DOI10.1016/J.DISC.2016.10.014zbMATH Open1369.05130OpenAlexW2552701657MaRDI QIDQ2400567FDOQ2400567
Authors: Weihua He, Weihua Yang
Publication date: 29 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.10.014
Recommendations
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph theory
- On a closure concept in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Title not available (Why is that?)
- Every 3-connected essentially 10-connected line graph is Hamilton-connected
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Hamiltonian cycles in spanning subgraphs of line graphs
- Hamilton cycles in 5-connected line graphs
- Reflections on graph theory
- Title not available (Why is that?)
- The edge Hamiltonian path problem is NP-complete
Cited In (4)
This page was built for publication: Hamiltonian paths in spanning subgraphs of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400567)