Polychromatic 4-coloring of guillotine subdivisions

Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


A polychromatic k-coloring of a plane graph G is an assignment of k colors to the vertices of G such that each face of G, except possibly for the outer face, has all k colors on its boundary. A rectangular partition is a partition of a rectangle R into a set of non-overlapping rectangles such that no four rectangles meet at a point. It was conjectured in [Y. Dinitz, M.J. Katz, R. Krakovski, Guarding rectangular partitions, in: 23rd European Workshop Computational Geometry, 2007, pp. 30-33] that every rectangular partition admits a polychromatic 4-coloring. In this note we prove the conjecture for guillotine subdivisions - a well-studied subfamily of rectangular partitions.

Original languageEnglish
Pages (from-to)690-694
Number of pages5
JournalInformation Processing Letters
Issue number13
StatePublished - 15 Jun 2009
Externally publishedYes


  • Algorithms
  • Combinatorial and computational geometry
  • Guillotine subdivisions
  • Polychromatic coloring


Dive into the research topics of 'Polychromatic 4-coloring of guillotine subdivisions'. Together they form a unique fingerprint.

Cite this