Polychromatic Colorings of n-Dimensional Guillotine-Partitions

DOI10.1007/978-3-540-69733-6_12MaRDI QIDQ3511319zbMATH OpenOpenAlexFDO

Authors Balázs Keszegh

Publication date 10 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69733-6_12

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Box-respecting colorings of n-dimensional guillotine-partitions
• Polychromatic 4-coloring of guillotine subdivisions
• Polychromatic colorings of arbitrary rectangular partitions
• Colouring polytopic partitions in $\mathbb{R}^d$
• Partition problems in high dimensional boxes

Cited in

(7)

• Polychromatic colorings of rectangular partitions
• Polychromatic colorings of arbitrary rectangular partitions
• Cut equivalence of d-dimensional guillotine partitions
• Colouring polytopic partitions in $\mathbb{R}^d$
• Box-respecting colorings of n-dimensional guillotine-partitions
• Polychromatic colorings of plane graphs
• Polychromatic 4-coloring of guillotine subdivisions

This page was built for publication: Polychromatic 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 Q3511319)