Kuratowski's theorem (Q837902)
Jump to navigation
Jump to search
a finite graph is planar iff it does not contain a subgraph that is a subdivision of K₅ or K₃,₃
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kuratowski's theorem |
a finite graph is planar iff it does not contain a subgraph that is a subdivision of K₅ or K₃,₃ |
Statements
1930
0 references
Identifiers
Sitelinks
Wikipedia(15 entries)
- dewiki Satz von Kuratowski
- enwiki Kuratowski's theorem
- eswiki Teorema de Kuratowski
- fawiki قضیه کوراتوسکی
- fiwiki Kuratowskin teoreema
- huwiki Kuratowski-tétel
- jawiki クラトフスキ定理
- nlwiki Stelling van Kuratowski
- plwiki Twierdzenie Kuratowskiego
- ptwiki Teorema de Kuratowski
- ruwiki Теорема Понтрягина — Куратовского
- svwiki Kuratowskis sats
- ukwiki Теорема Понтрягіна — Куратовського
- viwiki Định lý Kuratowski
- zhwiki 库拉托夫斯基定理