Computing Sciences Universiteit Utrecht (2009)
Noga Alon, Maike Buchin, Bettina Speckmann, Tu Eindhoven, Robert Berke, Péter Csorba, ...
We show that the vertices of any plane graph in which every face is of size at least g can be colored by ⌊(3g − 5)/4⌋ colors so that every color appears in every face. This is nearly tight, as...
Contemporary Mathematics Graph Coloring Manifolds (2008)
Abstract. We introduce a new and rich class of graph coloring manifolds via the Hom complex construction of Lovász. The class comprises examples of Stiefel manifolds, series of spheres and products...
On the biased n-in-a-row game � (2008)
The biased version of the n-in-a-row game 1 is rather boring. The player who can occupy more
Polychromatic Colorings of Plane Graphs (2007)
Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, ...
We show that the vertices of any plane graph in which every face is of length at least g can be colored by ⌊(3g − 5)/4 ⌋ colors so that every color appears in every face. This is nearly tight,...