论文信息 - Polychromatic colorings of arbitrary rectangular partitions

Polychromatic colorings of arbitrary rectangular partitions

A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex 4-colorings of general partitions where every subrectangle is required to have all four colors appear on its boundary. It is shown that there exist general partitions that do not admit such a coloring. This answers a question of Dimitrov et al. [D. Dimitrov, E. Horev, R. Krakovski, Polychromatic colorings of rectangular partitions, Discrete Mathematics 309 (2009) 2957-2960]. It is also shown that the problem to determine if a given general partition has such a 4-coloring is NP-Complete. Some generalizations and related questions are also treated.

[1] Bettina Speckmann,et al. Polychromatic Colorings of Plane Graphs , 2008, SCG '08.

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

[3] 李幼升,et al. Ph , 1989 .

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

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

[6] Elad Horev,et al. Polychromatic 4-coloring of cubic bipartite plane graphs , 2012, Discret. Math..

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

[8] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..

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

[10] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[11] Elad Horev,et al. Polychromatic colorings of bounded degree plane graphs , 2009, J. Graph Theory.

[12] Maarten Löffler,et al. Polychromatic 4-coloring of guillotine subdivisions , 2009, Inf. Process. Lett..