Let G be a connected graph that is not Eulerian. Prove that it is possible to add a
Chapter 51, Problem 51.4(choose chapter or problem)
Let G be a connected graph that is not Eulerian. Prove that it is possible to add a single vertex to G, together with some edges from this new vertex to some old vertices such that the new graph is Eulerian.
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