Minimum Number of Palettes in Edge Colorings
- 541 Downloads
A proper edge-coloring of a graph defines at each vertex the set of colors of its incident edges. This set is called the palette of the vertex. In this paper we are interested in the minimum number of palettes taken over all possible proper colorings of a graph.
KeywordsEdge colouring Palette of a vertex
Mathematics Subject Classification05C15
Open AccessThis article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.