The shortest path in a graph

A path between two specific vertices

Visits every vertex exactly once

Visits every edge exactly once and returns to start