Polychromatic 4-coloring of guillotine subdivisions
From MaRDI portal
(Redirected from Publication:989455)
Recommendations
Cites work
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- A combinatorial theorem in plane geometry
- A short proof of Chvatal's Watchman Theorem
- GUARDING RECTANGULAR PARTITIONS
- Guarding rectangular art galleries
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- 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
Cited in
(8)- Balanced polychromatic 2-coloring of triangulations
- Polychromatic colorings of arbitrary rectangular partitions
- Facially-constrained colorings of plane graphs: a survey
- Keep your distance: land division with separation
- Polychromatic Colorings of n-Dimensional Guillotine-Partitions
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Polychromatic colorings of rectangular partitions
- Box-respecting colorings of \(n\)-dimensional guillotine-partitions
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)