Given a proper edge coloringφof a graphG, we define the paletteSG(v,φ)of a vertexv∈V(G)as the set of all colors appearing on edges incident withv.The palette index ˇs(G)ofGis the minimum number of distinct palettes occur-ring in a proper edge coloring ofG. In this paper we give an upper bound onthe palette index of a graphGin terms of cyclomatic numbercyc(G)ofGandmaximum degree∆(G)ofG. We also give a sharp upper bound for the paletteindex of unicycle and bicycle graphs.
No institution available
Mathematics
, 2025, Issue 1, pp. 1–10
ISSN Online: 0000-0000
DOI:
10.xxxx/example-doi