Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Discrete Mathematics and Combinatorics
A Note On Solid Coloring Of Pure Simplicial Complexes, Joseph O'Rourke
A Note On Solid Coloring Of Pure Simplicial Complexes, Joseph O'Rourke
Computer Science: Faculty Publications
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices that share a (d-1)-facet have the same color. In R2 this says that any planar map all of whose faces are triangles may be 3-colored, and in R3 it says that tetrahedra in a collection may be "solid 4-colored" so that no two glued face-to-face receive the same color.
Slider-Pinning Rigidity: A Maxwell-Laman-Type Theorem, Ileana Streinu, Louis Theran
Slider-Pinning Rigidity: A Maxwell-Laman-Type Theorem, Ileana Streinu, Louis Theran
Computer Science: Faculty Publications
We define and study slider-pinning rigidity, giving a complete combinatorial characterization. This is done via direction-slider networks, which are a generalization of Whiteley’s direction networks.