logo

Video encyclopedia

Planar graph

2:08

Planar Graphs

1:09

Definition of a Planar graph

1:53

5.1 Planar graph

3:40

what is a planar graph

3:19

Planar and Non 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 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.
    • Kuratowski's and Wagner's theorems 

    • Other planarity criteria 

    • Related families of graphs 

    • Enumeration of planar graphs 

    • Other facts and definitions