The point-distinguishing chromatic index. (English) Zbl 0562.05023

Harary, Frank; Plantholt, Michael

Graphs and applications, Proc. 1st Symp. Graph theory, Boulder/Colo. 1982, 147-162 (1985).

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.

Reviewer: O.Frank

MSC:

05C15	Coloring of graphs and hypergraphs
05C35	Extremal problems in graph theory

Keywords:

edge-coloring; chromatic numbers; chromatic index