If a connected graph has exactly two odd vertices, A and
Chapter 14, Problem 14.1.52(choose chapter or problem)
If a connected graph has exactly two odd vertices, A and B, then each Euler path must begin at vertex A and end at vertex , or begin at vertex B and end at vertex A.
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