Coloring rectangular blocks in 3-space

DOI10.7151/DMGT.1535MaRDI QIDQ3171423zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Colton Magnant, Daniel Martin

Publication date 5 October 2011

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1535

zbMATH Keywords

chromatic numberchannel assignment problem3-dimensional rectangular blocks

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Two-floor buildings need eight colors
• On corners of objects built from parallelepiped bricks
• On coloring box graphs
• Coloring Axis-Parallel Rectangles
• Coloring axis-parallel rectangles

Cited in

(9)

• Weak Roman domination in rooted product graphs
• Burling graphs, chromatic number, and orthogonal tree-decompositions
• Contact graphs of boxes with unidirectional contacts
• Two-floor buildings need eight colors
• Burling graphs, chromatic number, and orthogonal tree-decompositions
• Chromatic number of regular walls.
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number
• On corners of objects built from parallelepiped bricks
• Graphs obtained from collections of blocks

This page was built for publication: Coloring rectangular blocks in 3-space

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