Question 1.29
29. The smallest number of edges that must be added to the accompanying graph for it to have an Euler circuit is
- 3.
- 6.
- 7.
29.
a
29. The smallest number of edges that must be added to the accompanying graph for it to have an Euler circuit is
29.
a