Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2009.07.019 | Discrete Mathematics |
Keywords | Field | DocType |
discrete mathematics,graphs | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Generalization,Rectangle,Partition (number theory),Mathematics | Journal |
Volume | Issue | ISSN |
310 | 1 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.35 | 9 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Gerbner | 1 | 46 | 21.61 |
| Balázs Keszegh | 2 | 156 | 24.36 |
| Nathan Lemons | 3 | 67 | 9.49 |
| Cory Palmer | 4 | 44 | 10.33 |
| Dömötör Pálvölgyi | 5 | 202 | 29.14 |
| Balázs Patkós | 6 | 85 | 21.60 |