Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Kuratowski's theorem · Vinony

🌐English

English Deutsch Español Nederlands Polski Português Svenska Tiếng Việt Türkçe Русский فارسی 中文日本語

EntityQ837902· pop 15· linked from 34 articles

Kuratowski's theorem

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

Connections

Categories

Statements about planar graphs Theorems in graph theory

Sources

wikipedia.externallinksexternallink

International Standard Book Number

Entity

digital object identifier

Kazimierz Kuratowski

Euler characteristic

time complexity

graph isomorphism

Mathematical Reviews

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.42

friendship graph

Entitydist 0.54

k-vertex-connected graph

Entitydist 0.56

claw-free graph

Entitydist 0.56

k-edge-connected graph

Entitydist 0.58

Entitydist 0.60

Entitydist 0.63

Entitydist 0.63

topological sorting

Entitydist 0.64

Entitydist 0.65

feedback vertex set

Entitydist 0.65

Entitydist 0.65

What links here34 pages

Kazimierz Kuratowski

forbidden graph characterization

Wagner's theorem

planarity testing

structured program theorem

outerplanar graph

three utilities problem