Edge-colored graph

from Wikipedia, the free encyclopedia

As edge-colored graph is referred to in the graph theory a graph whose edge is assigned a color.

Formally, this is usually a natural number (as a rule, it is not the value of the number that matters, only the distinguishability of the numbers from one another) or an element of any discrete set .

In addition to specifying the number of nodes and edges, an edge-colored graph also includes the specification of a function that maps the edges into the number of colors.