Vertex Edge Graphs Review

Euler paths must touch

• all edges
• all vertices

Does this graph have an Euler Path, Euler Circuit, both, or neither?

• Euler Path
• Euler Circuit
• Both
• Neither

This graph will have a Euler's Circuit

• True
• False

Which of the following is the Euler's Circuit

• KLQPQOKLOMK

• KLQMPQOKNLOMK

• KLQMPQOK

• KMOLNKOQMK

How do we quickly determine if a graph will have a Euler's Circuit?

• All even degree valences

• Exactly 2 odd degree valences

• Every Vertex will be used once

• I have no clue

Circuits start and stop at

• same vertex

• different vertices

• DUI Checkpoints

• the sound of the bass

Paths start and stop at

• same vertex

• different vertices

• the beginning and the end

• green lights and red lights

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

Does this graph have a Hamiltonian Circuit?

• True
• False