Current Research on Planar Graphs

Abstract

A graph consists of a set of vertices and a set of edges, each joining two vertices. A graph is planar if it can be embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed embedding. Planar graphs have attracted computer scientists' interest due to their enormous applications, and a lot of interesting algorithms and complexity results have been obtained for planar graphs. In this talk we survey the results on planar graphs.