Planar Graphs

Abstract

In Graph Theory, a planar graph is a graph which can be embedded in the plane i.e., it can be drawn on the plane in such a manner that its edges intersect only at their endpoints. A planar graph which has already drawn in the plane without edge intersection is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a map** from every node to a point in 2D space, and from every edge to a pane curve, such that the extreme points of each curve are the points mapped from its end nodes, and all the curves are disjoint except on their extreme points. Plane graphs can be encoded by combinatorial maps.