Graph Theory: Euler

Circuits start and stop at 

• same vertex
• different vertices

Tags

CCSS.5.G.A.1

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 Path. 

• True
• False

This graph will have a Euler's Circuit

• True
• False

Identify the Euler's Circuit

• KLQPQOKLOMK
• KLQMPQOKNLOMK
• KLQMPQOK
• KMOLNKOQMK

Does this graph have a Euler's Path? 

• 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

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

• True
• False

Is the following graph connected?

• Yes

• No

Is the following graph connected?

• Yes

• No