k-Coloring
A 
-coloring of a Graph 
is an assignment of one of possible colors to each vertex of such that no two adjacent vertices receive the same color.
References
Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 13, 1986.
- Cardioid Involute
- Cardioid Pedal Curve
- Cards
- Carleman's Inequality
- Carlson-Levin Constant
- Carlson's Theorem
- Carlyle Circle
- Carmichael Condition
- Carmichael Function
- Carmichael Number
- Carmichael's Conjecture
- Carmichael Sequence
- Carmichael's Theorem
- Carmichael's Totient Function Conjecture
- Carnot's Polygon Theorem
- Carnot's Theorem
- Carotid-Kundalini Fractal
- Carotid-Kundalini Function
- Carry
- Carrying Capacity
- Cartan Matrix
- Cartan Relation
- Cartan Subgroup
- Cartan Torsion Coefficient
- Cartesian Coordinates