Assignment of each graph edge of a graph to one of two color classes (commonly designation "red" and "green").
Graph Two-Coloring
See also
Bipartite Graph, Blue-Empty Graph, Graham's Number, Monochromatic Forced TriangleExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Graph Two-Coloring." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GraphTwo-Coloring.html