gm-u4-t3-s2-d8
Interactive
Build a route that visits every vertex once — Hamiltonian path or cycle, contrasted with Eulerian edge-tracing.
Want a different take?
Already have one and want another angle on this point? Describe what students should notice. Requests are read and acted on.