A coloring of a graph is an assignment of colors (or labels) to the vertices of the graph such that no two vertices of the same color are joined by an edge.

Verify that each of the following graphs can be colored using two colors. What other properties do these graphs share? Make a conjecture about two-colorable graphs.