21 citations · 92 across the 45 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★ 2 cited
Two-Page Book Embeddings of 4-Planar Graphs
Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou
Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In t…