Skip to main content
Article
Coloring Rectangular Blocks in 3-Space
Discussiones Mathematicae Graph Theory (2011)
  • Colton Magnant, Georgia Southern University
  • Daniel M. Martin, Universidade Federal do ABC
Abstract
If rooms in an office building are allowed to be any rectangular solid, how many colors does it take to paint any configuration of rooms so that no two rooms sharing a wall or ceiling/floor get the same color? In this work, we provide a new construction which shows this number can be arbitrarily large.
Keywords
  • Chromatic number,
  • Channel assignment problem,
  • 3 dimensional rectangular blocks
Disciplines
Publication Date
2011
DOI
10.7151/dmgt.1535
Publisher Statement
Citation Information
Colton Magnant and Daniel M. Martin. "Coloring Rectangular Blocks in 3-Space" Discussiones Mathematicae Graph Theory Vol. 31 Iss. 1 (2011) p. 161 - 170 ISSN: 2083-5892
Available at: http://works.bepress.com/colton_magnant/5/