Sorry, no definitions found. Check out and contribute to the discussion of this word!


Sorry, no etymologies found.


    Sorry, no example sentences found.


Log in or sign up to get involved in the conversation. It's quick and easy.

  • (Math Theorem) A graph is Eulerian (i.e. a Euler tour is possible) if and only if all its vertices have even degree. That is at each point, the number of edges going into that point is even. (From Everything2.Com)

    June 10, 2008