Euler Path
Afjal Hossan Sarower
Lecturer, Daffodil International University
Euler Path
Euler Path
Euler Path
Euler Path
Euler Path
Rules (Euler Path)
• A connected graph contains an Euler path and not an Euler circuit if and only if it has exactly 2 vertices of odd degree.
Rules (Euler Circuit)
• If the degree of every vertex in a connected graph is even, then it contains an Euler circuit.
• If the graph is directed, then Euler circuit
exists if the in-degree of every vertex is equal to its out-degree.
Euler Path vs. Euler Circuit
Every Euler circuit is an Euler path but every Euler path is not an Euler circuit. Euler path may start and end on different vertex.
A graph that contains Euler Path but no Euler Circuit is known as Semi-Euler Graph.
