Determine whether each graph has an Euler circuit. Construct such a circuit when one exists. Solution an Eulerian path is a path in the connected graph which coverseach edge exactly once and an eulerian circuit is an eulerian pathwhich starts and ends at the same vertex. (1) has no euler circuit while the path c,a,e,b,c cannot coverd or c,a,b,e,d cannot cover the edge a e. (3) has the eulerian circuit a,e,c,a,b,e,d,c,e,b,d..