Suppose {G} is an undirected connected graph. There is a l…

Twetch ·

Suppose {G} is an undirected connected graph.

There is a linear time algorithm for testing
whether the graph is 2-colorable...