Understand the meaning of Eulerian trail, semi-Eulerian graph, Eulerian circuit and Eulerian graph, and the conditions for their existence.

gm-u4-t3-s2-d6

Interactive

When can you traverse every edge?

manipulative

Toggle streets and watch degrees — 0 odd vertices allow an Euler circuit; exactly 2 allow a trail; otherwise neither.

Open fullscreen →

Request an applet

Describe the interactive you’d like — same inbox as applet feedback, tagged as a request for this syllabus id.