Bipartite freeware
Bipartite
Added: May 10, 2013 | Visits: 513
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.
Platforms: Windows, Mac, *nix, Python, BSD Solaris
License: Freeware | Download (53): Edge-coloring of a bipartite graph Download |