undirected unweighted graph
ChromaticIndex and EdgeChromaticNumber compute the chromatic index (or edge chromatic number) of a graph G. If a name col is specified, then this name is assigned the list of color classes of an optimal proper edge coloring. The algorithm uses a backtracking technique, except when G is bipartite, where a more efficient algorithm is used.
K4 ≔ CompleteGraph⁡4
K4 ≔ Graph 1: an undirected unweighted graph with 4 vertices and 6 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.