(idea) by artemis entreri Fri Dec 29 2000 at 2:12:27

In combinatorics, an Eulerian cycle is a cycle in a graph whose edges are all of the edges of the graph.

del.icio.us Facebook Digg StumbleUpon Reddit (I like it!)
Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.