Let G be a connected graph that is not Eulerian. In G there must be an even number of
Chapter 51, Problem 51.5(choose chapter or problem)
Let G be a connected graph that is not Eulerian. In G there must be an even number of odd-degree vertices (see Exercise 47.15). Let a1; b1; a2; b2; : : : ; at ; bt be the vertices of odd degree in G. If we add edges a1b1; a2b2; : : : ; atbt to G, does this give an Eulerian graph?
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