Graphs and Combinatorics

, Volume 30, Issue 3, pp 619–626 | Cite as

Minimum Number of Palettes in Edge Colorings

  • Mirko Horňák
  • Rafał KalinowskiEmail author
  • Mariusz Meszka
  • Mariusz Woźniak
Open Access
Original Paper


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.


Edge colouring Palette of a vertex 

Mathematics Subject Classification



  1. 1.
    Burris A.C., Schelp R.H.: Vertex-distinguishing proper edge-colourings. J. Graph Theory 26, 73–82 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Černý J., Horňák M., Soták R.: Observability of a graph. Math. Slovaca 46, 21–31 (1996)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Edwards K., Horňák M., Woźniak M.: On the neighbour-distinguishing index of a graph. Graph Combin. 22, 341–350 (2006)CrossRefzbMATHGoogle Scholar
  4. 4.
    Woolbright D.E., Fu H-L.: On the existence of rainbows in 1-factorizat-ions of K 2n. J. Combin. Des 6, 1–20 (1998)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© The Author(s) 2013

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.

Authors and Affiliations

  • Mirko Horňák
    • 1
  • Rafał Kalinowski
    • 2
    Email author
  • Mariusz Meszka
    • 2
  • Mariusz Woźniak
    • 2
  1. 1.Institute of Mathematics, P.J. Šafárik UniversityKošiceSlovakia
  2. 2.Department of Discrete MathematicsFaculty of Applied Mathematics AGHKrakówPoland

Personalised recommendations