The palette index of some Cartesian products of graphsVesel, Aleksander (Avtor) palette indexCartesian productregular graphsThe palette of a vertex v in a graph ▫$G$▫ is the set of colors assigned to the edges incident to ▫$v$▫. The palette index of ▫$G$▫ is the minimum number of distinct palettes among the vertices, taken over all proper edge colorings of ▫$G$▫. This paper presents results on the palette index of the Cartesian product ▫$G \Box H$▫, where one of the factor graphs is a path or a cycle. Additionally, it provides exact results and bounds on the palette index of the Cartesian product of two graphs, where one factor graph is isomorphic to a regular or class ▫$1$▫ nearly regular graph.Technical University Press20262026-01-18 04:21:48Znanstveno delo96539UDK: 519.17COBISS_ID: 248322819DOI: 10.7151/dmgt.2594ISSN pri članku: 1234-3099sl