Euler Circuit

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

• All even degree vertices

• Exactly 2 odd degree vertices

• Every Vertex will be used once
• All odd degree vertices

Choose the correct term to match each definition: Lines or curves that connect vertices.

• Regions

• Vertices

• Edges

• Paths

Paths start and stop at

• same vertex
• different vertices

Circuits start and stop at 

• same vertex
• different vertices

The diagram has how many odd vertices?

• 4

• 5

• 6

• 7

This diagram has how many even vertices?

• 1

• 2

• 3

• 4

This graph will have a Euler Path.

• True
• False

This graph will have a Euler Circuit.

• True
• False

Find the Euler Path

• 5, 0, 1, 3, 4, 3, 2

• 1, 2, 3, 4

• 0, 1, 2, 3, 4, 5,

• There is no Euler Path.

Find the Euler Circuit

• C, A, B, C, D, F, G, H, F, E, C

• C, D, F, G, H, F, E, C, C, A, B

• G, H, F, E, C, A, B, C, D, F

• The correct answer is not listed.