Every 4-connected line graph of a planar graph is Hamiltonian (Q1340124)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 700940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 4-connected line graph of a planar graph is Hamiltonian |
scientific article; zbMATH DE number 700940 |
Statements
Every 4-connected line graph of a planar graph is Hamiltonian (English)
0 references
11 December 1994
0 references
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.
0 references
Hamiltonian
0 references
conjecture of Thomassen
0 references
4-connected line graphs
0 references
line graph
0 references
planar graph
0 references
0.8850009441375732
0 references
0.8653169870376587
0 references
0.8586286306381226
0 references
