quack quack quack

is a sequence of edges where each one begins where the last one ends. ➢ It can be thought of as a movement from one vertex to another by traversing edges.

• Path in a graph

• Circuit or Closed Path

• EULER PATH

• EULER CIRCUIT

is a path that uses every edge but does not use any edge more than once.

• EULER PATH THEOREM

• EULER CIRCUIT

• EULER PATH

• Path in a graph

is a path that ends at the same vertex at which it started.

• EULER PATH

• Circuit or Closed Path

• EULER CIRCUIT

• Path in a graph

Every vertex on a graph with an Euler circuit has an even degree, and, conversely, if in a connected graph every vertex has an even degree, then the graph has an Euler circuit.

• EULERIAN GRAPH THEOREM

• EULER PATH

• EULER CIRCUIT

• EULER’S CIRCUIT THEOREM

A connected graph is Eulerian if and only if every vertex of the graph is of even degree

• EULER’S CIRCUIT THEOREM

• EULERIAN GRAPH THEOREM

• EULER CIRCUIT

• Circuit or Closed Path

A circuit that uses every edge, but never uses the same edge twice, (the path may cross though vertices more than once), and the path begins and ends at the same vertex.

• Path in a graph

• EULER PATH

• EULER CIRCUIT

• EULER PATH THEOREM