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--

Log in or registerto write something here or to contact authors.