A strengthening of the Kuratowski planarity criterion for 3-connected graphs (Q797592)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A strengthening of the Kuratowski planarity criterion for 3-connected graphs |
scientific article; zbMATH DE number 3867364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strengthening of the Kuratowski planarity criterion for 3-connected graphs |
scientific article; zbMATH DE number 3867364 |
Statements
A strengthening of the Kuratowski planarity criterion for 3-connected graphs (English)
0 references
1984
0 references
It is proved that each 3-connected non-planar graph distinct from \(K_ 5\) contains a special subdivision of \(K_{3,3}\) with three pairwise non- adjacent non-subdivided edges (i.e., a cycle with three pairwise ''interwoven'' chords).
0 references
non-planar graph
0 references
subdivision
0 references
0.8626549243927002
0 references
0.8374901413917542
0 references
0.8244370222091675
0 references
0.7938416004180908
0 references
