Eulerian Cycle

Eulerian Cycle

Simple cycle that passes through all of the edges in an undirected graph.


In this graph, the cycle that is constituted in order by the edges a, b, c, d, e, g, m, f, h and n is a Eulerian cycle that starts and ends at vertex A.


It is not possible to define a Eulerian cycle in the graph below.

Try Buzzmath activities for free

and see how the platform can help you.