Prove that a graph G is 2^k-colorable if and only if it is the union of k bipartite graphs. Can anyone show the proof?
Follow Math Help Forum on Facebook and Google+
View Tag Cloud