Assertion: graph's node | /r/HasProperty | green
Facets:
Source sentences:
text: The two sets U {\displaystyle U} and V {\displaystyle V} may be thought of as a coloring of the graph with two colors: if one colors all nodes in U {\displaystyle U} blue, and all nodes in V {\displaystyle V} green, each edge has endpoints of differing colors, as is required in the graph coloring problem.
text: In contrast, such a coloring is impossible in the case of a non-bipartite graph, such as a triangle: after one node is colored blue and another green, the third vertex of the triangle is connected to vertices of both colors, preventing it from being assigned either color.