2. Consider the graph G given below.
C
e
es
ea
d
23
ез
b
es
R2
es
211
en
g
a
26
h
a) Describe a circuit that contains the vertex a and the edge {d,e}.
b) How do we know that an Euler trail exists between vertices b and d?
c) Describe an Euler trail from vertex b to vertex d by writing down a sequence of adjacent
vertices and edges.
d) Delete the edges e, and e, from G. Call this new graph G'. Find an Euler circuit in
G'by writing down the sequence of adjacent
vertices and edges.