Hamiltonian paths in spanning subgraphs of line graphs
From MaRDI portal
Publication:2400567
Recommendations
Cites work
- scientific article; zbMATH DE number 4173021 (Why is no real title available?)
- scientific article; zbMATH DE number 3353326 (Why is no real title available?)
- Every 3-connected essentially 10-connected line graph is Hamilton-connected
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Graph theory
- Hamilton cycles in 5-connected line graphs
- Hamiltonian cycles in spanning subgraphs of line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On a closure concept in claw-free graphs
- Reflections on graph theory
- The edge Hamiltonian path problem is NP-complete
Cited in
(6)- On traceable iterated line graph and Hamiltonian path index
- Structural properties of subdivided-line graphs
- Hamiltonian cycles in spanning subgraphs of line graphs
- The spanning connectivity of line graphs
- Structural properties of subdivided-line graphs
- Line graphs of bipartite graphs with Hamiltonian paths
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)