(thing) by artemis entreri Sat Feb 10 2001 at 3:08:29
In combinatorics, a eulerian graph is one containing a Euler cycle. For (connected) undirected graphs, this is true if every vertex has even degree. For directed graphs, this is true if every vertex has equal indegree and outdegree. Planar bipartite graphs are dual to planar Eulerian graphs and vice versa.

--back to combinatorics--
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.