Guest Session: 1 Question Remaining.
Create Account
to save progress.
Login
Graph Theory
hard
0:00.0
A path that uses every edge of a graph exactly once is a:
A
Hamilton path
B
Euler path
C
Simple path
D
Cycle
Submit Answer