Computer Science – Discrete Mathematics
Scientific paper
2010-12-17
Computer Science
Discrete Mathematics
11 pages, 6 figures
Scientific paper
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.
No associations
LandOfFree
A Note on Solid Coloring of Pure Simplicial Complexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Note on Solid Coloring of Pure Simplicial Complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Solid Coloring of Pure Simplicial Complexes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-155628