Hamiltonicity of 6-connected line graphs

DOI10.1016/j.dam.2010.07.011zbMath1215.05147OpenAlexW2002171901MaRDI QIDQ608282

Mingquan Zhan

Publication date: 25 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.07.011

zbMATH Keywords

Hamiltonianclaw-free graphsline graphsHamilton-connected

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

Hamilton cycles in 5-connected line graphs ⋮ On 3-connected Hamiltonian line graphs ⋮ Collapsible graphs and Hamiltonian connectedness of line graphs ⋮ How many conjectures can you stand? A survey ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ 2-factors with bounded number of components in claw-free graphs ⋮ Positive solutions of a discrete nonlinear third-order three-point eigenvalue problem with sign-changing Green's function ⋮ Collapsible graphs and Hamiltonicity of line graphs ⋮ Hamiltonicity of 3-arc graphs

Cites Work

• Unnamed Item
• On hamiltonian line graphs and connectivity
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• On a closure concept in claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• Hamiltonian results inK1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Hamilton connectivity of line graphs and claw‐free graphs

This page was built for publication: Hamiltonicity of 6-connected line graphs