Search Results for ""

Define a valid "coloring" to occur when no two faces with a common edge share the same color. Given two colors, there is a single way to color an octahedron (Ball and Coxeter ...

CP.

A "curve" (i.e., a continuous map of a one-dimensional interval) into a two-dimensional area (a plane-filling function) or a three-dimensional volume.

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

A set of points which do not lie on any of a certain class of hyperplanes.

The vectors +/-a_1, ..., +/-a_n in a three-space form a normalized eutactic star iff Tx=x for all x in the three-space.

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

Assignment of each graph edge of a graph to one of two color classes (commonly designation "red" and "green").

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).