An **Euler Circuit** is an Euler Trail that visits every edge exactly once and starts and ends at the same vertex.

A **Euler Circuit** exists in a connected graph iff every vertex has an even degree.

An **Euler Circuit** is an Euler Trail that visits every edge exactly once and starts and ends at the same vertex.

A **Euler Circuit** exists in a connected graph iff every vertex has an even degree.