Polychromatic 4-coloring of guillotine subdivisions
From MaRDI portal
Publication:989455
DOI10.1016/J.IPL.2009.03.006zbMATH Open1215.68254OpenAlexW2061450592MaRDI QIDQ989455FDOQ989455
Authors: Matthew J. Katz, Roi Krakovski, Maarten Löffler, Elad Aigner-Horev 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- A short proof of Chvatal's Watchman Theorem
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- Title not available (Why is that?)
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- A combinatorial theorem in plane geometry
- Polychromatic colorings of bounded degree plane graphs
- Polychromatic colorings of plane graphs
- The Grötzsch theorem for the hypergraph of maximal cliques
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- GUARDING RECTANGULAR PARTITIONS
- Guarding rectangular art galleries
Cited In (8)
- Box-respecting colorings of \(n\)-dimensional guillotine-partitions
- Polychromatic colorings of arbitrary rectangular partitions
- Polychromatic Colorings of n-Dimensional Guillotine-Partitions
- Polychromatic colorings of rectangular partitions
- Facially-constrained colorings of plane graphs: a survey
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Balanced polychromatic 2-coloring of triangulations
- Keep your distance: land division with separation
This page was built for publication: Polychromatic 4-coloring of guillotine subdivisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989455)
