Kuratowski's theorem
Sign in to savea finite graph is planar iff it does not contain a subgraph that is a subdivision of K₅ or K₃,₃
Wikidata facts
- Instance of
- forbidden graph characterization
- Named after
- Lev Pontryagin
- Image
- Forbys planar graphs example.png
Show 6 more facts
- statement describes
- planar graph
- proved by
- Paul A. Smith
- different from
- Kuratowski's closure-complement problem
- publication date
- 1930-00-00
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- graph theory
Sources (3)
via Wikidata · CC0