申論題

6. [15%] Which of the following graphs, K₆ (complete graph with 6 vertices) or K₇ (complete graph with 7 vertices) has closed Euler walk? Explain your answer as clear as possible. That is, in closed Euler walk, we allow each edge to be visited exactly once, and the initial vertex and ending vertex are the same. Can we modify the graph(s) to make it/them possible to contain a closed Euler walk?