We will adapt the convention that a graph is planar if it can be embedded
in the plane without edges crossing, and plane if it is already embedded in the
plane. Let the set of vertices and edges of a graph G be denoted by V (G) and
E(G), respectively, or by V and E if G is known from the context. Let (G)
denote the maximum degree of G.