bn:03549621n
Noun Concept
Categories: Graph coloring
EN
edge coloring  Algorithms for edge coloring  Applications of edge coloring  chromatic index  Edge chromatic number
EN
In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color. Wikipedia
DIFFERENT FROM