47 citations · 56 across the 6 of their papers we have counts for
4 papers · 1 filter
4-connected planar graphs are in -EPG
Therese Biedl, Claire Pennarun
We show that every 4-connected planar graph has a -EPG representation, i.e., every vertex is represented by a curve on the grid with at most three bends, and two vertices are…
Planar graphs as L-intersection or L-contact graphs
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun
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…
Power domination on triangular grids
Prosenjit Bose, Claire Pennarun, Sander Verdonschot
The concept of power domination emerged from the problem of monitoring electrical systems. Given a graph G and a set S V (G), a set M of monitored vertices is built as…
Power domination in maximal planar graphs
Paul Dorbec, Antonio González, Claire Pennarun
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…