3 papers
math.CO2026
On t-colorable k-plane drawings
Miriam Goetze, Michael Kaufmann, Soeren Terziadis
In this work, we introduce -colorable -plane drawings, that is, drawings of graphs with a -edge-coloring where every edge is crossed by at most edges of each color. We…
cs.CG2026
On the Recognition of Outerplanar Graphs with Queue Number 1
Michael A. Bekos, Thomas Depian, Stefan Felsner +7
A linear layout of a graph is defined as a total order of the vertices and a partition of the edges to pages. In a stack (queue) layout, no two edges on the same page may cross (ne…
cs.DM2026
A first view on the density of 5-planar graphs
Aaron Büngener, Jakob Franz, Michael Kaufmann +1
A key concept for many graph layout algorithms is planarity, a graph property that allows to draw vertices and edges crossing-free in the plane. Important is the generalization to…