Abstract
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. © 2013 The Author(s).
Author supplied keywords
Cite
CITATION STYLE
APA
Horňák, M., Kalinowski, R., Meszka, M., & Woźniak, M. (2014). Minimum Number of Palettes in Edge Colorings. Graphs and Combinatorics, 30(3), 619–626. https://doi.org/10.1007/s00373-013-1298-8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free