Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Pennarun, Claire"'
Autor:
Pennarun, Claire
Dans cette thèse, nous présentons trois problèmes concernant les graphes planaires.Nous travaillons tout d'abord sur les dessins planaires non-alignés, c'est-à-dire des dessins planaires de graphes sur une grille sans que deux sommets se trouven
Externí odkaz:
http://www.theses.fr/2017BORD0609/document
Autor:
De Carufel, Jean-Lou, Dumitrescu, Adrian, Meulemans, Wouter, Ophelders, Tim, Pennarun, Claire, Tóth, Csaba D, Verdonschot, Sander
Publikováno v:
Journal of Computational Geometry 11(2) (2021). Special Issue of Selected Papers from SoCG 2019
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of $n$ real numbers (for short, \emph{grid}). First, we prove that every such grid contains $\Omega(\log n)$ points in convex position and that
Externí odkaz:
http://arxiv.org/abs/1812.11332
Autor:
Biedl, Therese, Pennarun, Claire
We show that every 4-connected planar graph has a $B_3$-EPG representation, i.e., every vertex is represented by a curve on the grid with at most three bends, and two vertices are adjacent if and only if the corresponding curves share an edge of the
Externí odkaz:
http://arxiv.org/abs/1710.04583
The L-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel shapes in the plane. A subfamily of these graphs are {L, |, --}-contact graphs which are the contact graphs of axis parallel L, |, and -- shap
Externí odkaz:
http://arxiv.org/abs/1707.08833
The concept of power domination emerged from the problem of monitoring electrical systems. Given a graph G and a set S $\subseteq$ V (G), a set M of monitored vertices is built as follows: at first, M contains only the vertices of S and their direct
Externí odkaz:
http://arxiv.org/abs/1707.02760
Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation. For measur
Externí odkaz:
http://arxiv.org/abs/1706.10047
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count families of subs
Externí odkaz:
http://arxiv.org/abs/1610.09837
Autor:
Biedl, Therese, Pennarun, Claire
A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible $n\times n$-grid.
Externí odkaz:
http://arxiv.org/abs/1606.02220
Publikováno v:
In European Journal of Combinatorics October 2017 65:59-91
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.