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.

• Dimensionality Theorem
• Dimension Axiom
• Dimension Invariance Theorem
• Diminished Polyhedron
• Diminished Rhombicosidodecahedron
• Dini Expansion
• Dini's Surface
• Dini's Test
• Dinitz Problem
• Diocles's Cissoid
• Diophantine Equation
• Diophantine Equation--10th Powers
• Diophantine Equation--5th Powers
• Diophantine Equation--6th Powers
• Diophantine Equation--7th Powers
• Diophantine Equation--8th Powers
• Diophantine Equation--9th Powers
• Diophantine Equation--Cubic
• Diophantine Equation--Linear
• Diophantine Equation nth Powers
• Diophantine Equation--Quadratic
• Diophantine Equation--Quartic
• Diophantine Quadruple
• Diophantine Set
• Diophantus Property