the puzzle of the seven bridge in the Konigsberg d(A)=3 The graph is no Euler circuit. c Theorem 5.7: A connected multigraph 只 has an Euler path but not an circuit if and only if it has exactly two vertices (b) of odd degree d(A)=d(D)=d(C)=3,d(D)=5 The graph is no Euler path.the puzzle of the seven bridge in the Königsberg d(A)=3. The graph is no Euler circuit. Theorem 5.7: A connected multigraph has an Euler path but not an circuit if and only if it has exactly two vertices of odd degree. d(A)=d(D)=d(C)=3, d(D)=5 The graph is no Euler path