Skip to Main content Skip to Navigation
Conference papers

Intersection Graphs of L-Shapes and Segments in the Plane

Abstract : An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: L, L , L and L. A k-bend path is a simple path in the plane, whose direction changes k times from horizontal to vertical. If a graph admits an intersection representation in which every vertex is represented by an L, an L or L , a k-bend path, or a segment, then this graph is called an {L}-graph, {L, L }-graph, B k-VPG-graph or SEG-graph, respectively. Motivated by a theorem of Middendorf and Pfeiffer [Discrete Mathematics, 108(1):365–372, 1992], stating that every {L, L }-graph is a SEG-graph, we investigate several known subclasses of SEG-graphs and show that they are {L}-graphs, or B k-VPG-graphs for some small constant k. We show that all planar 3-trees, all line graphs of planar graphs, and all full subdivisions of planar graphs are {L}-graphs. Furthermore we show that complements of pla-nar graphs are B17-VPG-graphs and complements of full subdivisions are B2-VPG-graphs. Here a full subdivision is a graph in which each edge is subdivided at least once.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Kolja Knauer <>
Submitted on : Monday, February 6, 2017 - 3:46:44 PM
Last modification on : Tuesday, December 29, 2020 - 3:08:05 AM
Long-term archiving on: : Sunday, May 7, 2017 - 2:30:40 PM


Files produced by the author(s)


  • HAL Id : hal-01457818, version 1



Stefan Felsner, Kolja Knauer, George Mertzios, Torsten Ueckerdt. Intersection Graphs of L-Shapes and Segments in the Plane. MFCS 2014, Aug 2014, Budapest, Hungary. ⟨hal-01457818⟩



Record views


Files downloads