1 citations · 2 across the 7 of their papers we have counts for
5 papers · 1 filter
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…
Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
Aaron Büngener, Michael Kaufmann
The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of for the number of crossings in any drawing of a given graph…
On -planar Graphs without Short Cycles
Michael A. Bekos, Prosenjit Bose, Aaron Büngener +6
We study the impact of forbidding short cycles to the edge density of -planar graphs; a -planar graph is one that can be drawn in the plane with at most crossings per edg…
The Density Formula: One Lemma to Bound Them All
Michael Kaufmann, Boris Klemz, Kristin Knorr +3
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in t…
Linear Layouts of Bipartite Planar Graphs
Henry Förster, Michael Kaufmann, Laura Merker +2
A linear layout of a graph consists of a linear order of the vertices and a partition of the edges. A part is called a queue (stack) if no two edges nest (cross), tha…