Segment representation of a subclass of co-planar graphs

2010/11/05 by Francis, Mathew C., Kratochvíl, Jan, Vyskočil, Tomáš
#05C62 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1011.1332

Abstract

A graph is said to be a segment graph if its vertices can be mapped to line segments in the plane such that two vertices have an edge between them if and only if their corresponding line segments intersect. Kratochvíl and Kuběna [``On intersection representations of co-planar graphs'', Discrete Mathematics, 178(1-3):251-255, 1998] asked the question of whether the complements of planar graphs are segment graphs. We show here that the complements of all partial 2-trees are segment graphs.

Related

• Segment representations with small resolution
• Intersection Graphs of L-Shapes and Segments in the Plane
• Intersection Graphs of Rays and Grounded Segments
• Segment Intersection Representations, Level Planarity and Constrained Ordering Problems
• The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs