Planar graph

Kuratowski's and Wagner's theorems 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 or the complete bipartite graph (utility graph). A subdivision of a graph results from inserting vertices into edges (for example, changing an edge 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 or 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. contains a minor isomorphic to the graph, and is therefore non-planar 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 (linear time) whether the graph may be planar or not (see planarity testing). 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 (regions bounded by edges, including the outer, infinitely large region), then :v-e+f=2. 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 (except possibly the outer one) 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 : :e\leq 3v-6. 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 (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 of a planar graph, or network, is the ratio of the number of bounded faces (the same as the circuit rank of the graph, by Mac Lane's planarity criterion) by its maximal possible values for a graph with vertices: :D = \frac{f-1}{2v-5} The density obeys , with for a completely sparse planar graph (a tree), and for a completely dense (maximal) planar graph. Dual graph Given an embedding of a (not necessarily simple) connected graph in the plane without edge intersections, we construct the dual graph as follows: we choose one vertex in each face of (including the outer face) 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 (not necessarily simple) 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 (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 is maximal planar. All its faces are bounded by three edges. 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 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 (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: 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 or of . The above is a direct corollary of the fact that a graph is outerplanar if the graph formed from 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 a planar embedding is -outerplanar if removing the vertices on the outer face results in a -outerplanar embedding. A graph is -outerplanar if it has a -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 ). A sufficient condition that a graph can be drawn convexly is that it is a subdivision of a 3-vertex-connected planar graph. Tutte's spring theorem even states that for simple 3-vertex-connected planar graphs the position of the inner vertices can be chosen to be the average of its neighbors. Word-representable planar graphs Word-representable planar graphs include triangle-free planar graphs and, more generally, 3-colourable planar graphs, as well as certain face subdivisions of triangular grid graphs, and certain triangulations of grid-covered cylinder graphs. ==Theorems==

Enumeration of planar graphs The asymptotic for the number of (labeled) planar graphs on n vertices is g\cdot n^{-7/2}\cdot \gamma^n\cdot n!, where \gamma\approx 27.22687 and g\approx 0.43\times 10^{-5}. Almost all planar graphs have an exponential number of automorphisms. The number of unlabeled (non-isomorphic) planar graphs on n vertices is between 27.2^n and 30.06^n. Other results The four color theorem states that every planar graph is 4-colorable (i.e., 4-partite). Fáry's theorem states that every simple planar graph admits a representation as a planar straight-line graph. A universal point set is a set of points such that every planar graph with n vertices has such an embedding with all vertices in the point set; there exist universal point sets of quadratic size, formed by taking a rectangular subset of the integer lattice. Every simple outerplanar graph admits an embedding in the plane such that all vertices lie on a fixed circle and all edges are straight line segments that lie inside the disk and don't intersect, so n-vertex regular polygons are universal for outerplanar graphs. Scheinerman's conjecture (now a theorem) states that every planar graph can be represented as an intersection graph of line segments in the plane. The planar separator theorem states that every n-vertex planar graph can be partitioned into two subgraphs of size at most 2n/3 by the removal of O(\sqrt{n}) vertices. As a consequence, planar graphs also have treewidth and branch-width O(). The planar product structure theorem states that every planar graph is a subgraph of the strong graph product of a graph of treewidth at most 8 and a path. This result has been used to show that planar graphs have bounded queue number, bounded non-repetitive chromatic number, and universal graphs of near-linear size. It also has applications to vertex ranking and p-centered colouring of planar graphs. For two planar graphs with v vertices, it is possible to determine in time O(v) whether they are isomorphic or not (see also graph isomorphism problem). Any planar graph on n nodes has at most 8(n-2) maximal cliques, which implies that the class of planar graphs is a class with few cliques. According to Tutte's theorem on Hamiltonian cycles, every 4-vertex-connected planar graph has a Hamiltonian cycle. ==Generalizations==

An apex graph is a graph that may be made planar by the removal of one vertex, and a k-apex graph is a graph that may be made planar by the removal of at most k vertices. A 1-planar graph is a graph that may be drawn in the plane with at most one simple crossing per edge, and a k-planar graph is a graph that may be drawn with at most k simple crossings per edge. A map graph is a graph formed from a set of finitely many simply-connected interior-disjoint regions in the plane by connecting two regions when they share at least one boundary point. When at most three regions meet at a point, the result is a planar graph, but when four or more regions meet at a point, the result can be nonplanar (for example, if one thinks of a circle divided into sectors, with the sectors being the regions, then the corresponding map graph is the complete graph as all the sectors have a common boundary point - the centre point). A toroidal graph is a graph that can be embedded without crossings on the torus. More generally, the genus of a graph is the minimum genus of a two-dimensional surface into which the graph may be embedded; planar graphs have genus zero and nonplanar toroidal graphs have genus one. Every graph can be embedded without crossings into some (orientable, connected) closed two-dimensional surface (sphere with handles) and thus the genus of a graph is well defined. Obviously, if the graph can be embedded without crossings into a (orientable, connected, closed) surface with genus g, it can be embedded without crossings into all (orientable, connected, closed) surfaces with greater or equal genus. There are also other concepts in graph theory that are called "X genus" with "X" some qualifier; in general these differ from the above defined concept of "genus" without any qualifier. Especially the non-orientable genus of a graph (using non-orientable surfaces in its definition) is different for a general graph from the genus of that graph (using orientable surfaces in its definition). Any graph may be embedded into three-dimensional space without crossings. In fact, any graph can be drawn without crossings in a two plane setup, where two planes are placed on top of each other and the edges are allowed to "jump up" and "drop down" from one plane to the other at any place (not just at the graph vertices) so that the edges can avoid intersections with other edges. This can be interpreted as saying that it is possible to make any electrical conductor network with a two-sided circuit board where electrical connection between the sides of the board can be made (as is possible with typical real life circuit boards, with the electrical connections on the top side of the board achieved through pieces of wire and at the bottom side by tracks of copper constructed on to the board itself and electrical connection between the sides of the board achieved through drilling holes, passing the wires through the holes and soldering them into the tracks); one can also interpret this as saying that in order to build any road network, one only needs just bridges or just tunnels, not both (2 levels is enough, 3 is not needed). Also, in three dimensions the question about drawing the graph without crossings is trivial. However, a three-dimensional analogue of the planar graphs is provided by the linklessly embeddable graphs, graphs that can be embedded into three-dimensional space in such a way that no two cycles are topologically linked with each other. In analogy to Kuratowski's and Wagner's characterizations of the planar graphs as being the graphs that do not contain K5 or K3,3 as a minor, the linklessly embeddable graphs may be characterized as the graphs that do not contain as a minor any of the seven graphs in the Petersen family. In analogy to the characterizations of the outerplanar and planar graphs as being the graphs with Colin de Verdière graph invariant at most two or three, the linklessly embeddable graphs are the graphs that have Colin de Verdière invariant at most four. ==See also==