Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
planar graphs
graph planarity |
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kuratowski's theorem
|
| gptkbp:involves |
gptkb:K3,3
gptkb:K5 |
| gptkbp:namedAfter |
gptkb:Kazimierz_Kuratowski
|
| gptkbp:publishedIn |
gptkb:Fundamenta_Mathematicae
|
| gptkbp:relatedTo |
gptkb:Wagner's_theorem
forbidden minor characterization planar embedding |
| gptkbp:state |
A finite graph is planar if and only if it does not contain a subgraph that is a subdivision of K5 or K3,3.
|
| gptkbp:usedIn |
planarity testing
|
| gptkbp:yearProposed |
1930
|
| gptkbp:bfsParent |
gptkb:Kazimierz_Kuratowski
|
| gptkbp:bfsLayer |
5
|