USER REVIEWS
Edge-coloring of a bipartite graph
Konig's theorem tells us that every bipartite graph with maximum vertex-degree d can be edge-colored with just d colors. This script allows you to verify this theorem.
WRITE USER REVIEW