GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/ChromaticIndex

GraphTheory

  

ChromaticIndex

  

EdgeChromaticNumber

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

ChromaticIndex(G, col)

EdgeChromaticNumber(G, col)

Parameters

G

-

undirected unweighted graph

col

-

(optional) name

Description

• 

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.

Examples

withGraphTheory:

K4CompleteGraph4

K4:=Graph 1: an undirected unweighted graph with 4 vertices and 6 edge(s)

(1)

EdgeChromaticNumberK4,'col'

3

(2)

col

1,2,3,4,1,3,2,4,1,4,2,3

(3)

DrawGraphK4

See Also

ChromaticNumber

CircularEdgeChromaticNumber

IsEdgeColorable

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam