47 citations · 56 across the 6 of their papers we have counts for
Showing 2017 · cs.CGShow all
2 papers · 2 filters
cs.CG2017
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…
cs.CG2017
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…