84 citations · 146 across the 36 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
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.CG2014★ 13 cited
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
Michael A. Bekos, Sabine Cornelsen, Luca Grilli +2
Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed mor…
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…