5.3Euler and Hamilton paths ☆53.1 Euler paths o Definition 19: A path in a graph G is called an Euler path if it includes every edge exactly once An Euler circuit is an Euler path that is a circuit Theorem 5.6: A connected multigraph has an Euler circuit if and only if each of its vertices has even degree5.3Euler and Hamilton paths ❖ 5.3.1 Euler paths ❖ Definition 19: A path in a graph G is called an Euler path if it includes every edge exactly once. An Euler circuit is an Euler path that is a circuit ❖ Theorem 5.6: A connected multigraph has an Euler circuit if and only if each of its vertices has even degree