Corpus ID: 12952638

A Note on Solid Coloring of Pure Simplicial Complexes

@article{ORourke2010ANO,
  title={A Note on Solid Coloring of Pure Simplicial Complexes},
  author={J. O'Rourke},
  journal={ArXiv},
  year={2010},
  volume={abs/1012.4017}
}
  • J. O'Rourke
  • Published 2010
  • Mathematics, Computer Science
  • ArXiv
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in R^d may be colored with d+1 colors so that no two simplices that share a (d-1)-facet have the same color. In R^2 this says that any planar map all of whose faces are triangles may be 3-colored, and in R^3 it says that tetrahedra in a collection may be "solid 4-colored" so that no two glued face-to-face receive the same color. 
1 Citations
On coloring box graphs

References

SHOWING 1-5 OF 5 REFERENCES
Coloring Objects Built From Bricks
  • 3
  • PDF
Rhombic Penrose Tilings Can Be 3-Colored
  • 20
On Colouring the Nodes of a Network
  • 635