<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=96539"><dc:title>The palette index of some Cartesian products of graphs</dc:title><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:subject>palette index</dc:subject><dc:subject>Cartesian product</dc:subject><dc:subject>regular graphs</dc:subject><dc:description>The 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.</dc:description><dc:publisher>Technical University Press</dc:publisher><dc:date>2026</dc:date><dc:date>2026-01-18 04:21:48</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>96539</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
