A graph is k-colorable if each vertex can be given one of k colors, and no edge connects identically colored vertices. Give a linear-time algorithm to test a graph for two-colorability. Assume graphs are stored in adjacency-list format; you must specify any additional data structures that are needed.
We need at least 9 more requests to produce the solution.
1 / 10 have requested this problem solution
The more requests, the faster the answer.