Collapsible graphs and Hamiltonicity of line graphs
From MaRDI portal
Recommendations
Cites work
- A method in graph theory
- A reduction method to find spanning Eulerian subgraphs
- Collapsible graphs and Hamiltonicity of line graphs
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Graphs without spanning closed trails
- Hamilton connectivity of line graphs and claw‐free graphs
- Hamilton cycles in 5-connected line graphs
- Hamiltonian connectedness in 3-connected line graphs
- Hamiltonian results inK1,3-free graphs
- Hamiltonicity of 6-connected line graphs
- On a closure concept in claw-free graphs
- On computing a conditional edge-connectivity of a graph
- On hamiltonian line graphs and connectivity
- Reflections on graph theory
Cited in
(4)
This page was built for publication: Collapsible graphs and Hamiltonicity of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742590)