Eulerian and Hamiltonian Walks (HSC SSCE Mathematics Standard): Flashcards

Edges (every edge exactly once)

Vertices (every vertex exactly once)

Uses every edge once, different start/end vertices

Uses every edge once, same start/end vertex

Connected graph with exactly 2 odd-degree vertices

Connected graph where all vertices have even degree

Visits every vertex once and only once

Hamiltonian path that starts & ends at same vertex

Use vertex degree rules (count odd-degree vertices)

No simple rule - inspect graph carefully