# Does this graph have Eulerian circuit paths?

For this graph, do Eulerian circuit path exist or not? Basic definition A Euler circuit is a circuit that uses every edge of a graph exactly once. A Euler circuit starts and ends at the same vertex.

As far as i know the B follows Eulerian circuit path while A is not, is it correct?

None of those graphs have an Eulerian circuit because they both have vertices of odd degree: $c,f$ in $A$ and $g,h$ in $B$.