2.3 For each of the graphs below (i) find the degree of each vertex (ii) use your
results from (i) to determine if the graph is eulerian, semi-eulerian, or neither,
and (iii) find an eulerian circuit or eulerian trail if it exists. Explain your answer.
(b)
a
g
f
e
(d)
b
h
j
d
i
g
C
h
a
e
b
d
C