Euler Graph

A Graph containing an Eulerian Circuit. An undirected Graph is Eulerian Iff every Vertex has Even Degree. A Directed Graph isEulerian Iff every Vertex has equal Indegree and Outdegree. A planarBipartite Graph is Dual to a planar Euler graph and vice versa. The number of Euler graphs with nodes are 1, 1, 2, 3, 7, 16, 54, 243, ... (Sloane's A002854).

References

Sloane, N. J. A. SequenceA002854/M0846in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.

• Sylvester Graph
• Sylvester Matrix
• Sylvester's Determinant Identity
• Sylvester's Four-Point Problem
• Sylvester's Inertia Law
• Sylvester's Line Problem
• Sylvester's Sequence
• Sylvester's Signature
• Sylvester's Triangle Problem
• Symbolic Logic
• Symmedian Line
• Symmedian Point
• Symmetric
• Symmetric Block Design
• Symmetric Design
• Symmetric Function
• Symmetric Group
• Symmetric Matrix
• Symmetric Points
• Symmetric Relation
• Symmetric Tensor
• Symmetroid
• Symmetry
• Symmetry Group
• Symmetry Operation