Eulerian and Hamiltonian Routes flashcards
6 practice cards drawn from the Eulerian and Hamiltonian Routes lessons. Tap a card to turn it over. Every answer is checked against the lesson it came from.
Read the Eulerian and Hamiltonian Routes lessons in full →
In this graph, what is the route A-B-C-D-E-C-A?
a circuit but not a cycle
from “Walks, Trails, Paths, Circuits and Cycles”
In this graph, what is the route A-B-C-D-E?
a path
from “Walks, Trails, Paths, Circuits and Cycles”
Does this graph have an Eulerian circuit?
no, but a trail can still use every edge
from “Eulerian Trails and Circuits”
A connected graph has exactly two vertices of odd degree. What follows?
a trail uses every edge, from one odd vertex to the other
from “Eulerian Trails and Circuits”
What is the marked route A-B-C-D-E-A?
a Hamiltonian cycle
from “Hamiltonian Paths and Cycles”
What is the marked route A-B-C-D-E?
a Hamiltonian path
from “Hamiltonian Paths and Cycles”