You’d just go through the vertices one by one, examining their connections. As the graph gets bigger, the time it takes to do this increases slowly, in what’s called polynomial time. As a result, a ...

He was later able to shrink the graph to 1,581 vertices and do a computer check to verify that it was not four-colorable. The discovery of any graph that requires five colors was a major ...