Suppose G is a graph with 100 vertices. One way to determine whether G is threecolorable
Chapter 52, Problem 52.17(choose chapter or problem)
Suppose G is a graph with 100 vertices. One way to determine whether G is threecolorable is to examine all possible three-colorings of G. If a computer can check 1 million colorings per second, about how long would it take to check all possible three-colorings?
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