Eulerian Trails and Circuits is a part of the VCE Further Maths topic Networks and Decision Maths. It is part of the subtopic Exploring and Travelling Problems. A Eulerian Trail is a trail that uses every edge of a graph exactly once and starts and ends at different vertices. A Eulerian Circuit is a circuit that uses every edge of a network exactly one and starts and ends at the same vertex.
Exploring and Travelling
Watch this video as an introduction.
Eulerian Graphs
Watch the following video to introduce you to the graphs of Eulerian circuits and trails.
Want to learn more? Check out more of our VCE Mathematics resources here!
