A strengthening of the Kuratowski planarity criterion for 3-connected graphs (Q797592): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strengthening of the Kuratowski planarity criterion for 3-connected graphs |
scientific article |
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
