Chvátal's Theorem
Let the Graph 
have Vertices with Valences 
. If for every 
we have either 
or 
, then the Graph is Hamiltonian.
- Chi Inequality
- Child
- Chinese Hypothesis
- Chinese Remainder Theorem
- Chinese Rings
- Chiral
- Chi-Squared Distribution
- Chi-Squared Test
- Choice Axiom
- Choice Number
- Cholesky Decomposition
- Choose
- Choquet Theory
- Chord
- Chordal
- Chordal Theorem
- Chow Coordinates
- Chow Ring
- Chow Variety
- Christoffel-Darboux Formula
- Christoffel-Darboux Identity
- Christoffel Formula
- Christoffel Number
- Christoffel Symbol of the First Kind
- Christoffel Symbol of the Second Kind