WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Eulerian Tour and Cycle Decomposition

​
number of edges
21
This Demonstration shows an example of a well-known result in graph theory that states that a connected graph
G
is Eulerian iff it has a cycle decomposition, that is, a family of edge-disjoint cycles whose union is
G
. As you drag the slider, you see an Eulerian path that travels the edges of the decomposition and colors each edge of the graph with a color corresponding to the cycle of the decomposition containing the edge. With the maximum number of edges, you can clearly see the complete cycle decomposition of the graph.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.