Skip to Main content Skip to Navigation

Planar graphs: non-aligned drawings, power domination and enumeration of Eulerian orientations

Abstract : In this thesis, we present results on three different problems concerning planar graphs. We first give some new results on planar non-aligned drawings, i.e., planar grid drawings where vertices are all on different rows and columns. We show that not every planar graph has a non-aligned drawing on a grid with n rows and columns, but we present two algorithms generating a non-aligned polyline drawings on such a grid requiring either n − 3 or min( (2n−5)/3 , #{separating triangles} + 1) bends in total. Concerning non-minimal grids, we give two algorithms drawing a planar non-aligned drawing on grids with area O(n^4). We also give specific results for 4-connected graphs and nested-triangle graphs. The second topic is power domination in planar graphs. We present a family of graphs with power dominating number γ_P at least n/6 . We then prove that for every maximal planar graph G of order n, γ_P (G) ≤ (n−2)/4 , and we give a constructive algorithm. We also prove that for triangular grids Tk of dimension k with hexagonal-shape border, γ_P (Tk) = \lceil k/3 \rceil. Finally, we focus on the enumeration of planar Eulerian orientations. After proposing a new decomposition for these maps, we define subsets and supersets of planar Eulerian orientations with parameter k, generated by looking at the orientations of the last 2k − 1 edges around the root vertex. For each set, we give a system of functional equations defining its generating function, and we prove that it is always algebraic. This way, we show that the growth rate of planar Eulerian orientations is between 11.56 and 13.005.
Complete list of metadata

Cited literature [169 references]  Display  Hide  Download
Contributor : Claire Pennarun <>
Submitted on : Thursday, June 29, 2017 - 3:28:17 PM
Last modification on : Friday, May 10, 2019 - 12:23:13 PM
Long-term archiving on: : Thursday, January 18, 2018 - 3:13:54 AM


  • HAL Id : tel-01550449, version 1


Claire Pennarun. Planar graphs: non-aligned drawings, power domination and enumeration of Eulerian orientations. Discrete Mathematics [cs.DM]. Université de Bordeaux, 2017. English. ⟨tel-01550449⟩



Record views


Files downloads