84 citations · 146 across the 36 of their papers we have counts for
Showing 2014 · cs.DMShow all
2 papers · 2 filters
cs.DM2014
The Maximum k-Differential Coloring Problem
Michael Bekos, Stephen Kobourov, Michael Kaufmann +1
Given an -vertex graph and two positive integers , the ()-differential coloring problem asks for a coloring of the vertices of (if one exists)…
cs.DM2014
The Density of Fan-Planar Graphs
Michael Kaufmann, Torsten Ueckerdt
A topological drawing of a graph is fan-planar if for each edge the edges crossing form a star and no endpoint of is enclosed by and its crossing edges. A fan-plana…