Some results on the palette index of graphs
Given a proper edge coloring $\varphi$ of a graph $G$, we define the palette $S_{G}(v,\varphi)$ of a vertex $v \in V(G)$ as the set of all colors appearing on edges incident with $v$. The palette index $\check s(G)$ of $G$ is the minimum number of distinct palettes occurring in a proper edge colorin...
| Autori principali: | , |
|---|---|
| Natura: | Articolo |
| Lingua: | English |
| Pubblicazione: |
Discrete Mathematics & Theoretical Computer Science
2019-05-01
|
| Serie: | Discrete Mathematics & Theoretical Computer Science |
| Soggetti: | |
| Accesso online: | https://dmtcs.episciences.org/4509/pdf |