ChromaticIndex(G, opt, col)
EdgeChromaticNumber(G, opt, col)
undirected unweighted graph
(optional) equation of the form method = value; specify method to use
method=one of fastest, optimal, or sat.
Specifies the algorithm to use in computing the chromatic index. The default, method=fastest, uses a hybrid strategy which runs the optimal and sat methods in parallel and returns the result of whichever method finishes first. The optimal method computes an edge coloring of the graph with the fewest possible colors; the sat method does the same but does so by encoding the problem as a logical formula.
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.
The task of verifying that the chromatic index of a graph is k is an NP-complete problem, meaning that no polynomial-time algorithm is known. The exhaustive search will take exponential time on some graphs.
K4 ≔ CompleteGraph⁡4
K4≔Graph 1: an undirected unweighted graph with 4 vertices and 6 edge(s)
The GraphTheory[ChromaticIndex] and GraphTheory[EdgeChromaticNumber] commands were updated in Maple 2019.
The method option was introduced in Maple 2019.
For more information on Maple 2019 changes, see Updates in Maple 2019.
Download Help Document
What kind of issue would you like to report? (Optional)