Every 4-connected line graph of a planar graph is Hamiltonian

DOI10.1007/BF02986673zbMath0813.05044OpenAlexW1984971264MaRDI QIDQ1340124

Hong-Jian Lai

Publication date: 11 December 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986673

zbMATH Keywords

Hamiltonianline graphplanar graphconjecture of Thomassen4-connected line graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items

A note on edge-disjoint Hamilton cycles in line graphs ⋮ Vertex-pancyclicity of edge-face-total graphs ⋮ How many conjectures can you stand? A survey ⋮ What is on his mind? ⋮ Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected ⋮ All 4-connected line graphs of claw free graphs are Hamiltonian connected

Cites Work

• On hamiltonian line graphs and connectivity
• A Theorem on Planar Graphs
• Reflections on graph theory
• Unnamed Item