UVa 10004

From Algorithmist
Jump to navigation Jump to search

10004 - Bicoloring[edit]

Summary[edit]

Determine whether a given graph is bicolorable.

Explanation[edit]

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

Solutions[edit]

http://shawonruet.blogspot.com/2016/07/uva-10004-bicoloring.html

http://codealltheproblems.blogspot.com/2015/06/uva-10004-bicoloring.html