Show that a graph is not orientable if it has a cut edge.
Chapter , Problem 39E(choose chapter or problem)
Show that a graph is not orientable if it has a cut edge. A tournament is a simple directed graph such that if u and v are distinct vertices in the graph, exactly one of (u, v) and (v, u) is an edge of the graph.
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