Abstract
We show that the vertices of any plane graph in which every face is incident to at least g vertices 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 where all faces are incident to at least g vertices and 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 k colors in which all colors appear in every face is in ℘ for k=2 and is \(\mathcal{NP}\) -complete for k=3,4. We refine this result for polychromatic 3-colorings restricted to 2-connected graphs which have face sizes from a prescribed (possibly infinite) set of integers. Thereby we find an almost complete characterization of these sets of integers (face sizes) for which the corresponding decision problem is in ℘, and for the others it is \(\mathcal{NP}\) -complete.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alon, N.: Problems and results in extremal combinatorics, ii. Discrete Math. 308, 4460–4472 (2008)
Alon, N., Krech, A., Szabó, T.: Turán’s theorem in the hypercube. SIAM J. Discrete Math. 21, 66–72 (2007)
Bose, P., Shermer, T., Toussaint, G., Zhu, B.: Guarding polyhedral terrains. Comput. Geom.: Theory Appl. 7(3), 173–185 (1997)
Bose, P., Kirkpatrick, D., Li, Z.: Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. Comput. Geom.: Theory Appl. 26(3), 209–219 (2003)
Dimitrov, D., Horev, E., Krakovski, R.: A note on polychromatic coloring of rectangular partitions. Discrete Math. 30(6), 2957–2960 (2009)
Dinitz, Y., Katz, M.J., Krakovski, R.: Guarding rectangular partitions. In: Abstracts 23rd European Workshop on Computational Geometry, pp. 30–33 (2007)
Horev, E., Katz, M.J., Krakovski, R.: Polychromatic coloring of cubic bipartite plane graphs (2009, submitted)
Guenin, B.: Packing T-joins and edge colouring in planar graphs. Manuscript (2003)
Gupta, R.P.: On the chromatic index and the cover index of a multigraph. In: Theory and Applications of Graphs, Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., 1976. Lecture Notes in Math., vol. 642, pp. 204–215. Springer, Berlin (1978)
Louis Hakimi, S., Kariv, O.: Generalization of edge-coloring in graphs. J. Graph Theory 10, 139–154 (1986)
Heawood, P.J.: On the four-color map theorem. Quart. J. Pure Appl. Math. 29, 270–285 (1898)
Hoffmann, F., Kriegel, K.: A graph-coloring result and its consequences for polygon-guarding problems. SIAM J. Discrete Math. 9, 210–224 (1996)
Horev, E., Krakovski, R.: Face-respecting colorings of bounded degree plane graphs. Manuscript (2007)
Kempe, A.B.: On the geographical problem of four colors. Am. J. Math. 2(3), 193–200 (1879)
Keszegh, B.: Polychromatic colorings of n-dimensional guillotine-partitions In: COCOON, pp. 110–118 (2008)
Lovász, L., Plummer, M.D.: Matching Theory. North-Holland, Amsterdam (1986)
Mohar, B., Skrekovski, R.: The Grötzsch theorem for the hypergraph of maximal cliques. Electron. J. Comb. 6, R26 (1999)
Moret, B.M.E.: Planar NAE3SAT is in P. SIGACT News 19(2), 51–54 (1988)
Offner, D.: Polychromatic colorings of subcubes of the hypercube. SIAM J. Discrete Math. 22(2), 450–454 (2008)
Seymour, P.D.: On multi-colourings of cubic graphs, and conjectures of Fulkerson and Tutte. Proc. Lond. Math. Soc. 3, 423–460 (1979)
Steinberg, R.: The state of the three color problem. Ann. Discrete Math. 55, 211–248 (1993)
Stockmeyer, L.: Planar 3-colorability is polynomial complete. SIGACT News 5(3), 19–25 (1973)
West, D.B.: Introduction to Graph Theory. Prentice Hall, New York (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research of N. Alon was supported in part by the Israel Science Foundation, by a USA–Israeli BSF grant, and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University.
Research of R. Berke was supported in part by JSPS Global COE program “Computationism as a Foundation for the Sciences.”
Research of K. Buchin and M. Buchin was supported by the Netherlands’ Organisation for Scientific Research (NWO) under BRICKS/FOCUS project no. 642.065.503.
Research of P. Csorba was supported by DIAMANT, an NWO mathematics cluster.
Research of B. Speckmann was supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 639.022.707.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Alon, N., Berke, R., Buchin, K. et al. Polychromatic Colorings of Plane Graphs. Discrete Comput Geom 42, 421–442 (2009). https://doi.org/10.1007/s00454-009-9171-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-009-9171-5