On topological aspects of orientations

De Fraysseix, Hubert and Ossona de Mendez, Patrice (2001) On topological aspects of orientations. [Journal (Paginated)]

Full text not available from this repository.


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.

Item Type: Journal (Paginated)
Additional Information: 10.1016/S0012-365X(00)00201-6
Classifications: Z Theory > Z.750 Topology
G Algorithms and Complexity > G.280 Canonical Ordering
Z Theory > Z.999 Others
G Algorithms and Complexity > G.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/735

Actions (login required)

View Item View Item