Planar graph

related topics
{math, number, function}
{math, energy, light}
{@card@, make, design}
{specie, animal, plant}
{area, part, region}
{woman, child, man}

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, easier words, a planar graph exists, if the graph can be drawn in such a way that no edges are intersecting - no edges crossing one another.)

A planar graph already drawn in the plane without edge intersections is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point in 2D space, and from every edge to a plane curve, 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. Plane graphs can be encoded by combinatorial maps.

It is easily seen that a graph that can be drawn on the plane can be drawn on the sphere as well, and vice versa.

The equivalence class of topologically equivalent drawings on the sphere is called a planar map. Although a plane graph has an external or unbounded face, none of the faces of a planar map have a particular status.

A generalization of planar graphs are graphs which can be drawn on a surface of a given genus. In this terminology, planar graphs have graph genus 0, since the plane (and the sphere) are surfaces of genus 0. See "graph embedding" for other related topics.

Contents

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 subdivision of a graph results from inserting vertices into edges (for example, changing an edge •——• to •—•—•) zero or more times. Equivalent formulations of this theorem, also known as "Theorem P" include

In the Soviet Union, Kuratowski's theorem was known as the Pontryagin-Kuratowski theorem, as its proof was allegedly first given in Pontryagin's unpublished notes. By a long-standing academic tradition, such references are not taken into account in determining priority, so the Russian name of the theorem is not acknowledged internationally.

Instead of considering subdivisions, Wagner's theorem deals with minors:

Full article ▸

related documents
Additive category
Bubble sort
Hausdorff space
Euler–Maclaurin formula
Spectral theorem
Binary tree
Binary heap
Polymorphism in object-oriented programming
Transcendental number
Self-organizing map
Inequality
Partial derivative
Universal property
Linear map
Total order
Analytic continuation
Euler–Mascheroni constant
Projective plane
Horner scheme
Octonion
Axiom schema of specification
Embedding
NP-complete
Splay tree
Array
Burnside's problem
Orthogonality
Convergence of random variables
Uniform convergence
Preadditive category