On topological aspects of orientations

We are concerned with two classes of planar graphs: maximal planar graphs (i.e. polyhedral graphs, triangulations) and maximal bipartite planar graphs (i.e. bipartite planar graphs with quadrilateral faces). For these graphs we consider constrained orientations with a constant indegree for the inter...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 229; no. 1; pp. 57 - 72
Main Authors de Fraysseix, H., Ossona de Mendez, P.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 28.02.2001
Elsevier
Subjects
Combinatorics
Mathematics
orientation
topological graph theory
Online AccessGet full text

Cover

More Information
Summary:We are concerned with two classes of planar graphs: maximal planar graphs (i.e. polyhedral graphs, triangulations) and maximal bipartite planar graphs (i.e. bipartite planar graphs with quadrilateral faces). For these graphs we consider constrained orientations with a constant indegree for the internal vertex set. We recall or prove new fundamental relations between these orientations, specific tree decompositions and bipolar orientations. In particular, these relations yield linear time computation algorithms. Using these orientations, we give a characterization of 4-connected maximal planar graphs and 3-connected planar graphs, which leads to simple linear time algorithms (de Fraysseix, Ossona de Mendez, Dagasthul Seminar Proceedings, Submitted for Publication).
ISSN:0012-365X
1872-681X
DOI:10.1016/S0012-365X(00)00201-6