Publisher review:Edge-coloring of a bipartite graph script allows you to verify Konig's theorem. 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.
Edge-coloring of a bipartite graph 1.0 is a Python script for Programming Methods and Algorithms scripts design by Alain Pointdexter.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
Edge-coloring of a bipartite graph script allows you to verify Konig's theorem.
Operating system:Windows / Linux / Mac OS / BSD / Solaris