Chords of longest circuits in 3-connected graphs (Q1398264)
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 1956039
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chords of longest circuits in 3-connected graphs |
scientific article; zbMATH DE number 1956039 |
Statements
Chords of longest circuits in 3-connected graphs (English)
0 references
29 July 2003
0 references
A conjecture of Thomassen says that every longest circuit of a 3-connected graph has a chord. This paper shows this to be true for a 3-connected graph embedded in a projective plane, having minimum degree 4.
0 references
longest circuit
0 references
chord
0 references
projective plane
0 references
0.926981508731842
0 references
0.9235143065452576
0 references
0.9099117517471312
0 references
0.8922943472862244
0 references
0.8922943472862244
0 references
