iterate through all vertices, coloring each vertex one color, all of its neighbors an alternate color, and all the neighbors of those neighbors the initial color. upon completion, re-iterate through the graph and return false if any vertex has a neighbor of the same color. if re-iteration goes to completion, return true.