| Webster's Online Dictionary |
| Expressions | Definition | ||
| Edge coloring | In graph theory, as with its vertex counterpart, an edge coloring of a graph, when mentioned without any qualification, is always assumed to be a proper coloring of the edges, meaning no two adjacent edges are assigned the same color. Here, "adjacent" means sharing a common vertex. A proper edge coloring with k colors is called a (proper) k-edge-coloring and is equivalent to the problem of partitioning the edge set into k matchings. A graph that can be assigned a (proper) k-edge-coloring is k-edge-colorable. A 3-edge-coloring of a cubic graph is sometimes called a Tait coloring. (references) | ||
Source: compiled by the editor from various references; see credits. | Top | ||
| Expressions | Domain | Definition | |
| Edge coloring | Math | An assignment of colors (or any distinct marks) to the edges of a graph. A coloring is a proper coloring if no two adjacent edges have the same color. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
