4(2)Suppose that G is a connected multigraph and the degree of every vertex of g is even o Let us apply induction on the number of edges of G 令1)e=1,oop The graph is an Euler circuit. The result holds 2)Suppose that result holds for esm e=m+1,δ(G)≥2. By the theorem 5.4, there is a simple circuit C in the graph G❖ (2)Suppose that G is a connected multigraph and the degree of every vertex of G is even. ❖ Let us apply induction on the number of edges of G ❖ 1)e=1,loop The graph is an Euler circuit. The result holds 2) Suppose that result holds for em e=m+1， (G)≥2. By the theorem 5.4, there is a simple circuit C in the graph G