an:03895095
Zbl 0562.05023
Harary, Frank; Plantholt, Michael
The point-distinguishing chromatic index
EN
Graphs and applications, Proc. 1st Symp. Graph theory, Boulder/Colo. 1982, 147-162 (1985).
1985
a
05C15 05C35
edge-coloring; chromatic numbers; chromatic index
Each edge of a graph is assigned one of k colors. The color distribution of a vertex is the color distribution in its incident edge set. The chromatic index studied here is the smallest k such that all vertices are distinguished by distinct color distributions. The value of the chromatic index is determined or estimated for various graphs.
O.Frank