Circuits and Paths

A Euler's Path or Hamiltonian Path start and end in the same place. 

• True
• False

A Euler's or Hamiltonian Circuit end and start in the same place. 

• True
• False

In a circuit or path, you can never use an edge twice. 

• True
• False

In a Hamiltonian Path or Circuit, you must use each edge. 

• True 
• False

In a Hamiltonian Circuit or Path, you can only use each vertex once. 

• True
• False

In a Euler's Circuit or Path, you must use each edge once. 

• True
• False

In a Euler's Circuit or Path, you cannot use a vertex twice. 

• True
• False

This graph will have a Euler's Path. 

• True
• False

This graph will have a Euler's Circuit

• True
• False

Identify the Euler's Circuit

• KLQPQOKLOMK
• KLQMPQOKNLOMK
• KLQMPQOK
• KMOLNKOQMK