Solved: Show that if a connected simple graph G is the
Chapter 9, Problem 9.4.40(choose chapter or problem)
Show that if a connected simple graph G is the union of the graphs G, and G2, then G, and G2 have at least one common vertex.
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