題組內容

1. A connected graph G is called an Euler graph, if there is a closedtrail which includes every edge of the graph G. An Euler circuit is acircuit that uses every edge of a graph exactly once. For followinggraphs, if it is an Euler graph, give an Euler circuit; if it is not anEuler graph, please give a reason. (25 %)

(b)