An orientation of an undirected simple graph is an
Chapter , Problem 37E(choose chapter or problem)
An orientation of an undirected simple graph is an assignment of directions to its edges such that the resulting directed graph is strongly connected. When an orientation of an undirected graph exists, this graph is called orientable. In Exercises 35–37 determine whether the given simple graph is orientable.
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