Recommendations
Cites work
- A reduction method to find spanning Eulerian subgraphs
- Graph theory
- Graphs without spanning closed trails
- Hamilton connectivity of line graphs and claw‐free graphs
- Hamiltonian connectedness in 3-connected line graphs
- Hamiltonian results inK1,3-free graphs
- Hamiltonicity in 3-connected claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On a closure concept in claw-free graphs
- On hamiltonian line graphs and connectivity
- Reflections on graph theory
Cited in
(13)- Positive solutions of a discrete nonlinear third-order three-point eigenvalue problem with sign-changing Green's function
- How many conjectures can you stand? A survey
- Hamilton cycles in 6-connected claw-free graphs (extended abstract)
- Hamilton connectivity of line graphs and claw‐free graphs
- 2-factors with bounded number of components in claw-free graphs
- On 3-connected Hamiltonian line graphs
- Hamilton cycles in 5-connected line graphs
- Collapsible graphs and Hamiltonian connectedness of line graphs
- Hamilton paths and cycles in vertex-transitive graphs of order 6p
- Hamiltonicity of 3-arc graphs
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
- Collapsible graphs and Hamiltonicity of line graphs
This page was built for publication: Hamiltonicity of 6-connected line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608282)
