Polychromatic colorings of rectangular partitions
From MaRDI portal
Publication:1043659
DOI10.1016/j.disc.2008.07.035zbMath1184.05025OpenAlexW2025961184MaRDI QIDQ1043659
Darko Dimitrov, Roi Krakovski, Elad Aigner-Horev
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.035
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Facially-constrained colorings of plane graphs: a survey ⋮ Polychromatic 4-coloring of cubic bipartite plane graphs ⋮ Polychromatic colorings of plane graphs ⋮ Box-respecting colorings of \(n\)-dimensional guillotine-partitions ⋮ Polychromatic colorings of bounded degree plane graphs ⋮ Balanced polychromatic 2-coloring of triangulations ⋮ Polychromatic colorings of arbitrary rectangular partitions
Cites Work
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Polychromatic colorings of arbitrary rectangular partitions
- The Grötzsch theorem for the hypergraph of maximal cliques
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- Polychromatic Colorings of n-Dimensional Guillotine-Partitions
- Polychromatic colorings of bounded degree plane graphs
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- Polychromatic colorings of plane graphs
- Unnamed Item