Question 1.77

47.

image
image
  1. Determine the minimum number of edges in the graph that have to be removed for the resulting graph to have all even-valent vertices.
  2. Does the graph you obtain in part (a) have an Euler circuit?
  3. Determine the minimum number of edges in the graph that have to be removed for the resulting graph to have all even-valent vertices.
  4. Does the graph you obtain in part (c) have an Euler circuit?

47.

(a) 2

(b) Yes

(c) 2

(d) No