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₃,₃
In the Vinony graph
Vinony's link graph records 34 inbound references to Kuratowski's theorem, and connects out to homeomorphism, Soviet Union and International Standard Book Number.
It sits within the topics Statements about planar graphs and Theorems in graph theory.
Vinony links it to 15 Wikipedia language editions.
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
Connections
homeomorphism
Entity
Soviet Union
Concept
International Standard Book Number
Entity
digital object identifier
Entity
plane
Entity
graph theory
Entity
curve
Entity
line segment
Entity
Kazimierz Kuratowski
Entity
Euler characteristic
Entity
Lev Pontryagin
Entity
complete graph
Entity
Semantic Scholar
Entity
node
Entity
planar graph
Entity
time complexity
Entity
Karl Menger
Entity
graph isomorphism
Entity
Mathematical Reviews
Entity
path
Entity