73 citations · 178 across the 49 of their papers we have counts for
6 papers · 1 filter
Planar Ramsey graphs
Maria Axenovich, Carsten Thomassen, Ursula Schade +1
We say that a graph is planar unavoidable if there is a planar graph such that any red/blue coloring of the edges of contains a monochromatic copy of , otherwise we…
Planar Graphs of Bounded Degree have Constant Queue Number
Michael A. Bekos, Henry Förster, Martin Gronemann +4
A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same que…
The number of crossings in multigraphs with no empty lens
Michael Kaufmann, Janos Pach, Geza Toth +1
Let be a multigraph with vertices and edges, drawn in the plane such that any two parallel edges form a simple closed curve with at least one vertex in its interior…
The Queue-Number of Posets of Bounded Width or Height
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Heath and Pemmaraju conjectured that the queue-number of a poset is bounded by its width and if the poset is planar then also by its height. We show that there are planar posets wh…
The interval number of a planar graph is at most three
Guillaume Guégan, Kolja Knauer, Jonathan Rollin +1
The interval number of a graph is the minimum such that one can assign to each vertex of a union of intervals on the real line, such that is the intersection gr…
Induced and Weak Induced Arboricities
Maria Axenovich, Philip Dörr, Jonathan Rollin +1
We define the induced arboricity of a graph , denoted by , as the smallest such that the edges of can be covered with induced forests in . This notio…