Bipartite Graph
A set of Vertices decomposed into two disjoint sets such that no two Vertices within the same set are adjacent. A bigraph is a special case of a k-PartiteGraph with 
.
References
Chartrand, G. Introductory Graph Theory. New York: Dover, p. 116, 1985. Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 12, 1986.
- Central Binomial Coefficient
- Central Conic
- Central Difference
- Centralizer
- Central Limit Theorem
- Central Trinomial Coefficient
- Centrode
- Centroid (Function)
- Centroid (Geometric)
- Centroid (Orthocentric System)
- Centroid (Triangle)
- Certificate of Compositeness
- Certificate of Primality
- Cesàro Equation
- Cesàro Fractal
- Cesàro Mean
- Ceva's Theorem
- Cevian
- Cevian Conjugate Point
- Cevian Transform
- Cevian Triangle
- Chain
- Chained Arrow Notation
- Chainette
- Chain Fraction