A characterization of graphs with small palette index

DOI10.3390/SYM15010154arXiv2212.10169MaRDI QIDQ6421087FDOQ6421087

Authors: D. Labbate, Davide Mattiolo, G. Mazzuoccolo, Federico Romaniello, Gloria Tabarelli 

Publication date: 20 December 2022

Abstract: Given an edge-coloring of a graph $G$, we associate to every vertex $v$ of $G$ the set of colors appearing on the edges incident with $v$. The palette index of $G$ is defined as the minimum number of such distinct sets, taken over all possible edge-colorings of $G$. A graph with a small palette index admits an edge-coloring which can be locally considered to be almost symmetric, since few different sets of colors appear around its vertices. Graphs with palette index $1$ are $r$-regular graphs admitting an $r$-edge-coloring, while regular graphs with palette index $2$ do not exist. Here, we characterize all graphs with palette index either $2$ or $3$ in terms of the existence of suitable decompositions in regular subgraphs. As a corollary, we obtain a complete characterization of regular graphs with palette index $3$.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: A characterization of graphs with small palette index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6421087)