# How to check whether a undirected graph is eulerian

*How to check whether a undirected graph is eulerian. A graph is called Eulerian if it contains Euler Cycle o Euler circuit. If graph contains only Euler Path then it is called semi Eulerian. An Euler cycle is a path in the graph which starts and ends at the same vertex. for more details follow the link Euler Cycles and Paths in Graph.*

*Condition for undirected graph*

**Euler Cycle: An undirected graph has Euler cycle if**

*All vertices with non-zero degree belong to single connected component.*

*All vertices must have even degree.*

*Eulerian Path : An undirected graph has Eulerian Path if *

*All vertices with non-zero degree belong to single connected component.**If zero or at most two vertices have odd degree and all other vertices have even degree.*

#### How to check whether a undirected graph is eulerian

Ref:

## Leave a Reply