Keywords

#kuratowski's_theorem

Kuratowski's theorem

On forbidden subgraphs in planar graphs

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 or of .

Tue 7th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Kuratowski's theorem Kazimierz Kuratowski Planar graph Wagner's theorem Kuratowski's intersection theorem Structured program theorem Kuratowski–Ulam theorem Kuratowski's free set theorem Brouwer fixed-point theorem Standard Borel space
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.