2 papers
cs.DS2021
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest
Sam Barr, Therese Biedl
1-planar graphs are graphs that can be drawn in the plane such that any edge intersects with at most one other edge. Ackerman showed that the edges of a 1-planar graph can be parti…
cs.DM2021
All Subgraphs of a Wheel are 5-Coupled-Choosable
Sam Barr, Therese Biedl
A wheel graph consists of a cycle along with a center vertex connected to every vertex in the cycle. In this paper we show that every subgraph of a wheel graph has list coupled chr…