7-1 Euler's Circuits and Paths

This graph will have an Euler Circuit.

• True

• False

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

• All even degree verticies
• Exactly 2 odd degree verticies
• Every Vertex will be used once
• I have no clue

Which of the graphs below have Euler circuits?

• I only

• II only

• Both I and II

• Neither I and II

Which of the graphs below have Euler circuits?

• I only

• II only

• Both I and II

• Neither I and II

Which of the graphs below have Euler circuits?

• I only

• II only

• Both I and II

• Neither I or II

What is the valence (degree) of vertex A in the graph ?

• 3

• 5

• 7

• 11

This graph will have an Euler Path.

• True

• False

What is the valence (degree) of vertex F in the graph ?

• 3

• 4

• 5

• 11

Does this graph have an Euler Path?

• True

• False

How do we quickly determine if the graph will have a Euler's Path

• All even degree verticies
• Exactly 2 odd degree verticies
• Each vertex will be used once
• I have no clue.