We noticed that a graph with more than two vertices of odd degree cannot have an
Chapter 51, Problem 51.2(choose chapter or problem)
We noticed that a graph with more than two vertices of odd degree cannot have an Eulerian trail, but connected graphs with zero or two vertices of odd degree do have Eulerian trails. The missing case is connected graphs with exactly one vertex of odd degree. What can you say about those graphs?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer