Eulerian Tour and Cycle Decomposition

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

This Demonstration shows an example of a well-known result in graph theory that states that a connected graph is Eulerian iff it has a cycle decomposition, that is, a family of edge-disjoint cycles whose union is . 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.

Contributed by: Sebastian Gonzalez Hermosillo de la Maza (May 2012)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.