1.Previous
3.Next

nor K_3,3 (the utility graph, a complete bipartite graph on six vertices). This was one of the earliest results in the theory of graph minors and can be seen as a forerunner of the Robertson-Seymour theorem.

Definitions and statement

A planar embedding of a given graph

1.Previous
3.Next