UVa 10004 - Bicoloring

10004 - Bicoloring

 * http://acm.uva.es/p/v100/10004.html

Summary
Determine whether a given graph is bicolorable.

Explanation
Bicolorable graphs are equivalent to bipartite graphs, and so the problem boils down to finding whether a given graph is bipartite. For more info on bipartite graphs, see here