Professional Documents
Culture Documents
(To find an Euler Circuit in such a graph, you can start at any vertex and just keep
following edges until you get back to your starting point, and then add in any
loop-de-loops you need to use up all the edges.)
More Examples
More Examples
More Examples
Euler Paths
Sometimes you can’t get back to where you started, but you can
cross each edge once and only once. This is called an Euler Path.
Example:
Euler Paths
So, when does a graph have an Euler Path?
Euler Paths
So, when does a graph have an Euler Path?
Think about the starting and ending points – what degree should
those vertices have?
Euler Paths
So, when does a graph have an Euler Path?
Think about the starting and ending points – what degree should
those vertices have?
What about the rest of the vertices – what degree should those
vertices have?
Euler Path Theorem
A graph has an Euler Path (but not an Euler Circuit) if and only if
exactly two of its vertices have odd degree and the rest have
even degree.
(The odd vertices will be the starting and ending vertices of the
Euler Path.)