Planar graph

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph, or a planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points.
Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection.
Plane graphs can be encoded by combinatorial maps or rotation systems.
An equivalence class of topologically equivalent drawings on the sphere, usually with additional assumptions such as the absence of isthmuses, is called a planar map. Although a plane graph has an external or unbounded face, none of the faces of a planar map has a particular status.
Planar graphs generalize to graphs drawable on a surface of a given genus. In this terminology, planar graphs have genus 0, since the plane are surfaces of genus 0. See "graph embedding" for other related topics.

Planarity criteria

Kuratowski's and Wagner's theorems

provided a characterization of planar graphs in terms of forbidden graphs, now known as Kuratowski's theorem:
A subdivision of a graph results from inserting vertices into edges (for example, changing an edge zero or more times.
Image:Nonplanar no subgraph K 3 3.svg|thumb|An example of a graph with no or subgraph. However, it contains a subdivision of and is therefore non-planar.
Instead of considering subdivisions, Wagner's theorem deals with minors:
A minor of a graph results from taking a subgraph and repeatedly contracting an edge into a vertex, with each neighbor of the original end-vertices becoming a neighbor of the new vertex.
Klaus Wagner asked more generally whether any minor-closed class of graphs is determined by a finite set 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 vertices, it is possible to determine in time whether the graph may be planar or not.
For a simple, connected, planar graph with vertices and edges and faces, the following simple conditions hold for :

Theorem 1. ;
Theorem 2. If there are no cycles of length 3, then.
Theorem 3..

In this sense, planar graphs are sparse graphs, in that they have only edges, asymptotically smaller than the maximum. The graph, for example, has 6 vertices, 9 edges, and no cycles of length 3. Therefore, by Theorem 2, it cannot be planar. These theorems provide necessary conditions for planarity that are not sufficient conditions, and therefore can only be used to prove a graph is not planar, not that it is planar. If both theorem 1 and 2 fail, other methods may be used.

Whitney's planarity criterion gives a characterization based on the existence of an algebraic dual;
Mac Lane's planarity criterion gives an algebraic characterization of finite planar graphs, via their cycle spaces;
The Fraysseix–Rosenstiehl planarity criterion gives a characterization based on the existence of a bipartition of the cotree edges of a depth-first search tree. It is central to the left-right planarity testing algorithm;
Schnyder's theorem gives a characterization of planarity in terms of partial order dimension;
Colin de Verdière's planarity criterion gives a characterization based on the maximum multiplicity of the second eigenvalue of certain Schrödinger operators defined by the graph.
The Hanani–Tutte theorem states that a graph is planar if and only if it has a drawing in which each independent pair of edges crosses an even number of times; it can be used to characterize the planar graphs via a system of equations modulo 2.
Properties

Euler's formula

Euler's formula states that if a finite, connected, planar graph is drawn in the plane without any edge intersections, and is the number of vertices, is the number of edges and is the number of faces, then
As an illustration, in the butterfly graph given above,, and.
In general, if the property holds for all planar graphs of faces, any change to the graph that creates an additional face while keeping the graph planar would keep an invariant. Since the property holds for all graphs with, by mathematical induction it holds for all cases. Euler's formula can also be proved as follows: if the graph isn't a tree, then remove an edge which completes a cycle. This lowers both and by one, leaving constant. Repeat until the remaining graph is a tree; trees have and, yielding, i. e., the Euler characteristic is 2.
In a finite, connected, simple, planar graph, any face is bounded by at least three edges and every edge touches at most two faces, so ; using Euler's formula, one can then show that these graphs are sparse in the sense that if :
File:Dodecahedron schlegel.svg|thumb|A Schlegel diagram of a regular dodecahedron, forming a planar graph from a convex polyhedron.
Euler's formula is also valid for convex polyhedra. This is no coincidence: every convex polyhedron can be turned into a connected, simple, planar graph by using the Schlegel diagram of the polyhedron, a perspective projection of the polyhedron onto a plane with the center of perspective chosen near the center of one of the polyhedron's faces. Not every planar graph corresponds to a convex polyhedron in this way: the trees do not, for example. Steinitz's theorem says that the polyhedral graphs formed from convex polyhedra are precisely the finite 3-connected simple planar graphs. More generally, Euler's formula applies to any polyhedron whose faces are simple polygons that form a surface topologically equivalent to a sphere, regardless of its convexity.

Average degree

Connected planar graphs with more than one edge obey the inequality, because each face has at least three face-edge incidences and each edge contributes exactly two incidences. It follows via algebraic transformations of this inequality with Euler's formula that for finite planar graphs the average degree is strictly less than 6. Graphs with higher average degree cannot be planar.

Coin graphs

We say that two circles drawn in a plane kiss whenever they intersect in exactly one point. A "coin graph" is a graph formed by a set of circles, no two of which have overlapping interiors, by making a vertex for each circle and an edge for each pair of circles that kiss. The circle packing theorem, first proved by Paul Koebe in 1936, states that a graph is planar if and only if it is a coin graph.
This result provides an easy proof of Fáry's theorem, that every simple planar graph can be embedded in the plane in such a way that its edges are straight line segments that do not cross each other. If one places each vertex of the graph at the center of the corresponding circle in a coin graph representation, then the line segments between centers of kissing circles do not cross any of the other edges.

Planar graph density

The meshedness coefficient or density of a planar graph, or network, is the ratio of the number of bounded faces by its maximal possible values for a graph with vertices:
The density obeys, with for
a completely sparse planar graph, and for a completely dense planar graph.

Dual graph

Given an embedding of a connected graph in the plane without edge intersections, we construct the dual graph as follows: we choose one vertex in each face of and for each edge in we introduce a new edge in connecting the two vertices in corresponding to the two faces in that meet at. Furthermore, this edge is drawn so that it crosses exactly once and that no other edge of or is intersected. Then is again the embedding of a planar graph; it has as many edges as, as many vertices as has faces and as many faces as has vertices. The term "dual" is justified by the fact that ; here the equality is the equivalence of embeddings on the sphere. If is the planar graph corresponding to a convex polyhedron, then is the planar graph corresponding to the dual polyhedron.
Duals are useful because many properties of the dual graph are related in simple ways to properties of the original graph, enabling results to be proven about graphs by examining their dual graphs.
While the dual constructed for a particular embedding is unique, graphs may have different duals, obtained from different embeddings.

Families of planar graphs

Maximal planar graphs

A simple graph is called maximal planar if it is planar but adding any edge would destroy that property. All faces are then bounded by three edges, explaining the alternative term plane triangulation. The alternative names "triangular graph" or "triangulated graph" have also been used, but are ambiguous, as they more commonly refer to the line graph of a complete graph and to the chordal graphs respectively. Every maximal planar graph on more than 3 vertices is at least 3-connected.
If a maximal planar graph has vertices with, then it has precisely edges and faces.
Apollonian networks are the maximal planar graphs formed by repeatedly splitting triangular faces into triples of smaller triangles. Equivalently, they are the planar 3-trees.
Strangulated graphs are the graphs in which every peripheral cycle is a triangle. In a maximal planar graph the peripheral cycles are the faces, so maximal planar graphs are strangulated. The strangulated graphs include also the chordal graphs, and are exactly the graphs that can be formed by clique-sums of complete graphs and maximal planar graphs.