Prove or disprove: If every edge of a graph G lies on an odd cycle, then _(G) = 3
Chapter 14, Problem 18(choose chapter or problem)
Prove or disprove: If every edge of a graph G lies on an odd cycle, then _(G) = 3.
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