Kizspy | Question: 110
(Choose 1 answer)
Let G be a simple graph with degree sequence [2, 2, 3, 1, 0]. Which of the following is TRUE?
A. G has an Euler circuit
B. G has an Euler path, but no Euler circuits
C. G has no Euler paths
D. None of the other choices
