Metraipolis › archive › dc_2986ceee8bb7
Kuratowski's theorem — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Kuratowski%27s_theorem
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-31T09:58:06.516Z
- SHA-256 of the archived text
26c69197e8e890a4f168dae55917d93dcca505bf8fba3d86ba88c022ca9eb210- Stable URL of this page
https://metraipolis.com/documento/dc_2986ceee8bb7
How to cite
Kuratowski's theorem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Kuratowski%27s_theorem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_2986ceee8bb7 (Metraipolis archive dc_2986ceee8bb7, sha256 26c69197e8e890a4f168dae55917d93dcca505bf8fba3d86ba88c022ca9eb210)
BibTeX
@misc{dc2986ceee8bb7,
title = {Kuratowski's theorem — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Kuratowski%27s_theorem},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_2986ceee8bb7; sha256 26c69197e8e890a4f168dae55917d93dcca505bf8fba3d86ba88c022ca9eb210},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Kuratowski%27s_theorem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states that a finite graph is planar if and only if it does not contain a subgraph that is a subdivision of K 5 {\displaystyle K_{5}} (the complete graph on five vertices) nor of K 3 , 3 {\displaystyle K_{3,3}} (a complete bipartite graph on six vertices, three of which connect to each of the other three, also known as the utility graph).
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Kuratowski's theorem» — https://en.wikipedia.org/wiki/Kuratowski%27s_theorem
Wikidata Q837902: «a finite graph is planar iff it does not contain a subgraph that is a subdivision of K₅ or K₃,₃» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q837902
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Kuratowski%27s_theorem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369859465, consultata il 2026-10-31T09:42:44.948Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 1a568877318defa5d7e74d0a09069970383e20cef40ef1ebbd64005b5c1129f1