Polychromatic colorings of arbitrary rectangular partitions
From MaRDI portal
Publication:1045138
DOI10.1016/j.disc.2009.07.019zbMath1198.05047OpenAlexW2048705332MaRDI QIDQ1045138
Nathan Lemons, Balázs Patkós, Dömötör Pálvölgyi, Balázs Keszegh, Cory Palmer, Dániel Gerbner
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.019
Partitions of sets (05A18) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items
Facially-constrained colorings of plane graphs: a survey ⋮ Box-respecting colorings of \(n\)-dimensional guillotine-partitions ⋮ Polychromatic colorings of rectangular partitions
Cites Work
- Unnamed Item
- Polychromatic 4-coloring of cubic bipartite plane graphs
- How to draw a planar graph on a grid
- Polychromatic 4-coloring of guillotine subdivisions
- Polychromatic colorings of rectangular partitions
- The Grötzsch theorem for the hypergraph of maximal cliques
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- GUARDING RECTANGULAR PARTITIONS
- Polychromatic Colorings of n-Dimensional Guillotine-Partitions
- Polychromatic colorings of bounded degree plane graphs
- Planar Formulae and Their Uses
- Polychromatic colorings of plane graphs
This page was built for publication: Polychromatic colorings of arbitrary rectangular partitions