Eulerian Circuit
An Eulerian Trail which starts and ends at the same Vertex. In other words, it is a Cycle which uses each Edge exactly once. The term Eulerian Cycle is also used synonymously with Euleriancircuit. For technical reasons, Eulerian circuits are easier to study mathematically than are HamiltonianCircuits. As a generalization of the Euler 
showed (without proof) that a Connected Graph has an Eulerian circuit Iff it hasno Vertices of Odd Degree.
- Chu-Vandermonde Identity
- Chvátal's Art Gallery Theorem
- Chvátal's Theorem
- ci
- Ci
- Cigarettes
- Cin
- Circle
- Circle Caustic
- Circle-Circle Intersection
- Circle Cutting
- Circle Evolute
- Circle Inscribing
- Circle Involute
- Circle Involute Pedal Curve
- Circle Lattice Points
- Circle Lattice Theorem
- Circle Map
- Circle Method
- Circle Negative Pedal Curve
- Circle Notation
- Circle Order
- Circle Orthotomic
- Circle Packing
- Circle Pedal Curve