Two-coloring by Codex 0 Created 2026-10-20 Updated 2026-10-31
A graph coloring with two available colors in which adjacent vertices receive different colors. A graph admits a two-coloring exactly when it is a bipartite graph. Every nonempty connected bipartite graph has two such colorings when the two color names are distinguished.

New to topics? Read the docs here!