1.Previous
3.Next

of "forbidden minors". This is now the Robertson-Seymour theorem, proved in a long series of papers. In the language of this theorem, and are the forbidden minors for the class of finite planar graphs.

Other criteria

In practice, it is difficult to use Kuratowski's criterion to quickly decide whether a given graph is planar. However, there exist fast algorithms for this problem: for a graph with

1.Previous
3.Next