Graph Theory

1. a) An Euler path is a trail in a graph which visits every edge exactly once.

 

Example:

The graph G₁ has an Euler path, a, c, d, e, b, d, a, b.

 

 

 

 

 

 

 

 

 

 

 

b) An Euler circuit is a trail which starts and ends on the

     same vertex.

 

Example:

The graph G₂ has an Euler circuit, a, e, c, d, e, b, a.