Polychromatic 4-coloring of guillotine subdivisions

DOI10.1016/j.ipl.2009.03.006zbMath1215.68254MaRDI QIDQ989455

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

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.006

zbMATH Keywords

algorithms; polychromatic coloring; combinatorial and computational geometry; guillotine subdivisions

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Polychromatic 4-coloring of cubic bipartite plane graphs, Box-respecting colorings of \(n\)-dimensional guillotine-partitions, Polychromatic colorings of arbitrary rectangular partitions

Cites Work

• Unnamed Item
• A short proof of Chvatal's Watchman Theorem
• The Grötzsch theorem for the hypergraph of maximal cliques
• Guarding rectangular art galleries
• A combinatorial theorem in plane geometry
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• GUARDING RECTANGULAR PARTITIONS
• Polychromatic colorings of bounded degree plane graphs
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
• Polychromatic colorings of plane graphs