<?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=51511"><dc:title>Behzad-Vizing conjecture and Cartesian-product graphs</dc:title><dc:creator>Zmazek,	Blaž	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>kartezični produkt grafov</dc:subject><dc:subject>kromatično število</dc:subject><dc:subject>popolno kromatično število</dc:subject><dc:subject>Vizingova domneva</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>Cartesian graph product</dc:subject><dc:subject>chromatic number</dc:subject><dc:subject>total chromatic number</dc:subject><dc:subject>Vizing conjecture</dc:subject><dc:subject/><dc:description>We prove the following theorem: if the Behzad-Vizing conjecture is true for graphs ▫$G$▫ and ▫$H$▫, then is it true for the cartesian product ▫$G Box H$▫.
</dc:description><dc:date>2004</dc:date><dc:date>2015-07-10 14:52:44</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>51511</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
