Color that graph!

Decide if the simple graph whose adjacency matrix is shown below is bipartite.
The idea is to draw the graph and try to color each vertex, using either red or blue, in such a way that no two adjacent vertices have the same color.

Bug note: occasionally this generator will create a matrix that is not symmetric about the main diagonal. In that case, it is not the matrix for a simple graph, and so the bipartite characteristic is irrelevant. If this happens, ignore the question, and reload the page to get a new problem.

Click here to see the solution.

Click "refresh" or "reload" to see another problem like this one.


Copyright (c) 2014, James Wooland, all rights reserved.