Euler Paths and Circuits

Tracing all edges on a figure without picking up your pencil and repeating and starting and stopping in the same spot

• Euler Circuit
• Euler Path

Circuits start and stop at 

• same vertex
• different vertices

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

What is the valence of vertex A in the graph ?

• 3

• 5

• 7

• 11

Is the following graph connected?

• Yes

• No

Euler paths must touch

• all edges
• all vertices

This graph will have a Euler's Circuit

• True
• False

Paths start and stop at

• same vertex
• different vertices

Tags

CCSS.HSG.CO.A.1

Is there a Path, Circuit, or Neither

• Path

• Circuit

• Neither

Is there a Path, Circuit, or Neither

• Path

• Circuit

• Neither