Edge coloring is a concept from graph theory that involves assigning colors to the edges of a graph such that no two edges that share a common vertex (or are incident to the same vertex) have the same color. The main goal of edge coloring is to minimize the number of colors used. The minimum number of colors required to color the edges of a graph is known as the graph's **chromatic index** or **edge-chromatic number**.
Articles by others on the same topic
An edge colouring assigns a colour to every edge of a graph. In a red-blue edge colouring of a complete graph, a triangle is monochromatic when its three edges have the same colour.