# On the geometric thickness of 2-degenerate graphs

A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every 2-degenerate graph can be drawn with straight lines such that the drawing decomposes into 4 plane forests. Therefore, the geometric arboricity, and hence the geometric thickness, of 2-degenerate graphs is at most 4. On the other hand, we show that there are 2-degenerate graphs that do not admit any straight-line drawing with a decomposition of the edge set into 2 plane graphs. That is, there are 2-degenerate graphs with geometric thickness, and hence geometric arboricity, at least 3. This answers two questions posed by Eppstein [Separating thickness from geometric thickness. In Towards a Theory of Geometric Graphs, vol. 342 of Contemp. Math., AMS, 2004].

• 52 publications
• 1 publication
• 6 publications
• 9 publications
research
04/24/2019

### Counting the Number of Crossings in Geometric Graphs

A geometric graph is a graph whose vertices are points in general positi...
research
06/11/2018

### Plane drawings of the generalized Delaunay-graphs for pseudo-disks

We study general Delaunay-graphs, which are a natural generalizations of...
research
06/22/2023

### Decomposition of Geometric Graphs into Star Forests

We solve a problem of Dujmović and Wood (2007) by showing that a complet...
research
06/19/2023

### From geometric quantiles to halfspace depths: A geometric approach for extremal behaviour

We investigate the asymptotics for two geometric measures, geometric qua...
research
12/20/2017

### Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors

Suppose we have an arrangement A of n geometric objects x_1, ..., x_n ⊆R...
research
05/02/2020

### Minimum Cuts in Geometric Intersection Graphs

Let 𝒟 be a set of n disks in the plane. The disk graph G_𝒟 for 𝒟 is the ...
research
03/23/2020

### Neural Contours: Learning to Draw Lines from 3D Shapes

This paper introduces a method for learning to generate line drawings fr...