Polychromatic Colorings of Plane Graphs

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 there are plane graphs that admit no vertex coloring of this type with more than (3g+1)=4 colors. We further show that the problem of determining whether a plane graph admits a vertex coloring by 3 colors in which all colors appear in every face is NP-complete even for graphs in which all faces are of size 3 or 4 only. If all faces are of size 3 this can be decided in polynomial time.

[1]  Noga Alon,et al.  Tur[a-acute]n's Theorem in the Hypercube , 2007, SIAM J. Discret. Math..

[2]  David G. Kirkpatrick,et al.  Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces , 2003, Comput. Geom..

[3]  David Offner.  Polychromatic Colorings of Subcubes of the Hypercube , 2008, SIAM J. Discret. Math..

[4]  Ram Prakash Gupta,et al.  On the chromatic index and the cover index of a multigraph , 1978 .

[5]  R. Steinberg.  The State of the Three Color Problem , 1993 .

[6]  Elad Horev,et al.  Polychromatic colorings of rectangular partitions , 2009, Discret. Math..

[7]  Matthew J. Katz,et al.  Guarding Rectangular Partitions , 2009, Int. J. Comput. Geom. Appl..

[8]  D. R. Lick,et al.  Theory and Applications of Graphs , 1978 .

[9]  D. West.  Introduction to Graph Theory , 1995 .

[10]  N. Alon,et al.  Turán ’ s theorem in the hypercube , 2006 .

[11]  Balázs Keszegh.  Polychromatic Colorings of n-Dimensional Guillotine-Partitions , 2008, COCOON.

[12]  S. Louis Hakimi,et al.  A generalization of edge-coloring in graphs , 1986, J. Graph Theory.

[13]  B. Moret,et al.  Planar NAE3SAT is in P , 1988, SIGA.

[14]  Noga Alon,et al.  Problems and results in extremal combinatorics - II , 2008, Discret. Math..

[15]  Larry Stockmeyer,et al.  Planar 3-colorability is polynomial complete , 1973, SIGA.

[16]  Prosenjit Bose,et al.  Guarding Polyhedral Terrains , 1997, Comput. Geom..

[17]  Noga Alon,et al.  Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon , 2007, SIAM J. Discret. Math..

[18]  A. Petermann.  ON THE FOUR-COLOR-MAP THEOREM , 2004 .

[19]  Elad Horev,et al.  Polychromatic colorings of bounded degree plane graphs , 2009 .

[20]  Frank Hoffmann,et al.  A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems , 1996, SIAM J. Discret. Math..

[21]  A. Kempe.  On the Geographical Problem of the Four Colours , 1879 .

[22]  Bojan Mohar,et al.  The Grötzsch Theorem for the Hypergraph of Maximal Cliques , 1999, Electron. J. Comb..

[23]  P. D. Seymour,et al.  On Multi‐Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte , 1979 .