Planar graphs as L-intersection or L-contact graphs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Planar graphs as L-intersection or L-contact graphs


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 − shapes in the plane. We prove here two results that were conjectured by Chaplick and Ueckerdt in 2013. We show that planar graphs are L-intersection graphs, and that triangle-free planar graphs are {L, |, −}-contact graphs. These results are obtained by a new and simple decomposition technique for 4-connected triangulations. Our results also provide a much simpler proof of the known fact that planar graphs are segment intersection graphs.
Fichier principal
Vignette du fichier
L-intersection_HAL.pdf (453.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01569535 , version 1 (27-07-2017)
hal-01569535 , version 2 (28-07-2017)



Daniel Gonçalves, Lucas Isenmann, Claire Pennarun. Planar graphs as L-intersection or L-contact graphs. 2017. ⟨hal-01569535v2⟩
390 View
609 Download



Gmail Facebook Twitter LinkedIn More