Kuratowski's theorem
id:
kuratowski-s-theorem-271-586323
title:
Kuratowski's theorem
text:
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 or of K 3 , 3 .
brand slug:
wiki
category slug:
encyclopedia
description:
On forbidden subgraphs in planar graphs
original url:
https://en.wikipedia.org/wiki/Kuratowski%27s_theorem
date created:
date modified:
2023-11-07T14:25:39Z
main entity:
{"identifier":"Q837902","url":"https://www.wikidata.org/entity/Q837902"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/73/GP92-Kuratowski.svg","width":473,"height":473}
fields total:
13
integrity:
15