3. [ 30 points ] The graph shown is K4 : a b (a) Does this graph have an Euler circuit? If so, what is it? If not, why n
Posted: Thu May 12, 2022 3:14 pm
3. [ 30 points ] The graph shown is K4 : a b (a) Does this graph have an Euler circuit? If so, what is it? If not, why not? (b) Does this graph have an Euler path? If so, what is it? If not, why not? (c) Does this graph have a Hamilton circuit? If so, what is it? If not, why not? (d) Verify that K4 is planar by re-drawing the graph so that no edges cross. (e) Use your graph in part (d) to verify “Euler's formula” : (# of edges ) -(# of vertices ) + 2 = (total # of regions, including outer region)