# Kuratowski's theorem

> a finite graph is planar iff it does not contain a subgraph that is a subdivision of K₅ or K₃,₃

**Wikidata**: [Q837902](https://www.wikidata.org/wiki/Q837902)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Kuratowski's_theorem)  
**Source**: https://4ort.xyz/entity/kuratowski-s-theorem


## References

1. Freebase Data Dumps. 2013
2. Quora