Graph that can be embedded in the plane
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 (and the sphere) are surfaces of genus 0. See "graph embedding" for other related topics.
Planarity criteria.
Kuratowski's and Wagner's theorems.
The Polish mathematician Kazimierz Kuratowski provided a characterization of planar graphs in terms of forbidden graphs, now known as Kuratowski's theorem:
A finite graph is planar if and only if it does not contain a subgraph that is a subdivision of the complete graph "K"5 or the complete bipartite graph "K"3,3 (utility graph).
A subdivision of a graph results from inserting vertices into edges (for example, changing an edge • —— • to • — • — • ) zero or more times.
Instead of considering subdivisions, Wagner's theorem deals with minors:
A finite graph is planar if and only if it does not have "K"5 or "K"3,3 as a minor.
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, "K"5 and "K"3,3 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 n vertices, it is possible to determine in time "O"("n") (linear time) whether the graph may be planar or not (see planarity testing).
For a simple, connected, planar graph with v vertices and e edges and f faces, the following simple conditions hold for "v" ≥ 3:
In this sense, planar graphs are sparse graphs, in that they have only "O"("v") edges, asymptotically smaller than the maximum "O"("v"2). The graph "K"3,3, 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.
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 v is the number of vertices, e is the number of edges and f is the number of faces (regions bounded by edges, including the outer, infinitely large region), then
formula_1
As an illustration, in the butterfly graph given above, "v" = 5, "e" = 6 and "f" = 3. 
In general, if the property holds for all planar graphs of f faces, any change to the graph that creates an additional face while keeping the graph planar would keep "v" – "e" + "f" an invariant. Since the property holds for all graphs with "f" = 2, 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 e and f by one, leaving "v" – "e" + "f" constant. Repeat until the remaining graph is a tree; trees have "v" = "e" + 1 and "f" = 1, yielding "v" – "e" + "f" = 2, i. e., the Euler characteristic is 2.
In a finite, connected, "simple", planar graph, any face (except possibly the outer one) is bounded by at least three edges and every edge touches at most two faces, so 3"f" ;= 2"e"; using Euler's formula, one can then show that these graphs are "sparse" in the sense that if "v" ≥ 3:
formula_2
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 2"e" ≥ 3"f", 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 "v" – "e" + "f" = 2 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" (or "osculate") 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 D of a planar graph, or network, is the ratio of the number "f" – 1 of bounded faces (the same as the circuit rank of the graph, by Mac Lane's planarity criterion) by its maximal possible values 2"v" – 5 for a graph with v vertices:
formula_3
The density obeys 0 ≤ "D" ≤ 1, with "D" = 0 for 
a completely sparse planar graph (a tree), and "D" = 1 for a completely dense (maximal) planar graph.
Dual graph.
Given an embedding G of a (not necessarily simple) connected graph in the plane without edge intersections, we construct the "dual graph" G* as follows: we choose one vertex in each face of G (including the outer face) and for each edge e in G we introduce a new edge in G* connecting the two vertices in G* corresponding to the two faces in G that meet at e. Furthermore, this edge is drawn so that it crosses e exactly once and that no other edge of G or G* is intersected. Then G* is again the embedding of a (not necessarily simple) planar graph; it has as many edges as G, as many vertices as G has faces and as many faces as G has vertices. The term "dual" is justified by the fact that "G"** = "G"; here the equality is the equivalence of embeddings on the sphere. If G is the planar graph corresponding to a convex polyhedron, then G* 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 (up to isomorphism), graphs may have different (i.e. non-isomorphic) duals, obtained from different (i.e. non-homeomorphic) embeddings.
Families of planar graphs.
Maximal planar graphs.
A simple graph is called maximal planar if it is planar but adding any edge (on the given vertex set) would destroy that property. All faces (including the outer one) are then bounded by three edges, explaining the alternative term plane triangulation (which technically means a plane drawing of the graph). 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 v vertices with "v" ; 2, then it has precisely 3"v" – 6 edges and 2"v" – 4 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 (or more generally a polyhedral 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 (without deleting edges) of complete graphs and maximal planar graphs.
Outerplanar graphs.
Outerplanar graphs are graphs with an embedding in the plane such that all vertices belong to the unbounded face of the embedding. Every outerplanar graph is planar, but the converse is not true: "K"4 is planar but not outerplanar. A theorem similar to Kuratowski's states that a finite graph is outerplanar if and only if it does not contain a subdivision of "K"4 or of "K"2,3. The above is a direct corollary of the fact that a graph G is outerplanar if the graph formed from G by adding a new vertex, with edges connecting it to all the other vertices, is a planar graph.
A 1-outerplanar embedding of a graph is the same as an outerplanar embedding. For "k" ; 1 a planar embedding is k-outerplanar if removing the vertices on the outer face results in a ("k" – 1)-outerplanar embedding. A graph is k-outerplanar if it has a k-outerplanar embedding.
Halin graphs.
A Halin graph is a graph formed from an undirected plane tree (with no degree-two nodes) by connecting its leaves into a cycle, in the order given by the plane embedding of the tree. Equivalently, it is a polyhedral graph in which one face is adjacent to all the others. Every Halin graph is planar. Like outerplanar graphs, Halin graphs have low treewidth, making many algorithmic problems on them more easily solved than in unrestricted planar graphs.
Upward planar graphs.
An upward planar graph is a directed acyclic graph that can be drawn in the plane with its edges as non-crossing curves that are consistently oriented in an upward direction. Not every planar directed acyclic graph is upward planar, and it is NP-complete to test whether a given graph is upward planar.
Convex planar graphs.
A planar graph is said to be convex if all of its faces (including the outer face) are convex polygons. Not all planar graphs have a convex embedding (e.g. the complete bipartite graph K2,4). A sufficient condition that a graph can be drawn convexly is