Every 4-connected line graph of a planar graph is Hamiltonian
type: Item
instance of: scholarly article
title: Every 4-connected line graph of a planar graph is Hamiltonian
zbMATH Open document ID: 0813.05044
DOI: 10.1007/BF02986673
author: Hong-Jian Lai
published in: Graphs and Combinatorics
publication date: 1994-12-11T00:00:00Z
review text: A conjecture of Thomassen states that all 4-connected line graphs are Hamiltonian. This paper is an attempt to prove the conjecture for the line graph of a planar graph. Seemingly, successful.
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 700940
zbMATH Keywords: Hamiltonian
zbMATH Keywords: conjecture of Thomassen
zbMATH Keywords: 4-connected line graphs
zbMATH Keywords: line graph
zbMATH Keywords: planar graph
reviewed by: Stelian Mihalas
MaRDI profile type: Publication
cites work: Q3097395
cites work: Reflections on graph theory
cites work: A Theorem on Planar Graphs
cites work: On hamiltonian line graphs and connectivity
full work available at URL: https://doi.org/10.1007/bf02986673
OpenAlex ID: W1984971264
description: scientific article; zbMATH DE number 700940