1 citations · 1 across the 9 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CG2023
On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs
Benedikt Künzel, Jonathan Rollin
Simultaneous Geometric Embedding (SGE) asks whether, for a given collection of graphs on the same vertex set V, there is an embedding of V in the plane that admits a crossing-free…
math.CO2023
On the geometric thickness of 2-degenerate graphs
Rahul Jain, Marco Ricci, Jonathan Rollin +1
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 decomp…