Show that if a connected graph G contains three vertices of degree 2, all of which are
Chapter 12, Problem 5(choose chapter or problem)
Show that if a connected graph G contains three vertices of degree 2, all of which are adjacent to two vertices u and v, then G is not Hamiltonian.
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