Box-respecting colorings of n-dimensional guillotine-partitions

DOI10.1016/J.DISC.2011.01.022MaRDI QIDQ533787zbMATH OpenOpenAlexFDO

Authors Balázs Keszegh

Publication date 6 May 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.01.022

zbMATH Keywords

box-respecting coloringsGuillotine-partitionspolychromatic coloringsrectangle-respecting coloringsrectangular partitions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Polychromatic Colorings of n-Dimensional Guillotine-Partitions
• Polychromatic 4-coloring of guillotine subdivisions
• Cut equivalence of d-dimensional guillotine partitions
• Partition problems in high dimensional boxes
• Colouring polytopic partitions in $\mathbb{R}^d$

Cites work

• GUARDING RECTANGULAR PARTITIONS
• Polychromatic 4-coloring of guillotine subdivisions
• Polychromatic colorings of arbitrary rectangular partitions
• Polychromatic colorings of bounded degree plane graphs
• Polychromatic colorings of plane graphs
• 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

Cited in

(2)

• Polychromatic Colorings of n-Dimensional Guillotine-Partitions
• Coloring \(t\)-dimensional \(m\)-boxes

This page was built for publication: Box-respecting colorings of \(n\)-dimensional guillotine-partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533787)