.
Now add duplicate edges to reduce the total number of odd vertices to 2.
So, this graph was Semi-Eulerized by adding 2 duplicate edges.
(Any Euler Path would begin at one of the remaining odd vertices and end at the other.)
| First, notice that the
graph has exactly 6 vertices of odd degree.
Now add duplicate edges to reduce the total number of odd vertices to 2.
So, this graph was Semi-Eulerized by adding 2 duplicate edges. (Any Euler Path would begin at one of the remaining odd vertices and end at the other.) |