<?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://repozitorij.upr.si/IzpisGradiva.php?id=3085"><dc:title>Hamilton paths and cycles in vertex-transitive graphs of order 6p</dc:title><dc:creator>Kutnar,	Klavdija	(Avtor)
	</dc:creator><dc:creator>Šparl,	Primož	(Avtor)
	</dc:creator><dc:subject>graph theory</dc:subject><dc:subject>vertex-transitive</dc:subject><dc:subject>Hamilton cycle</dc:subject><dc:subject>Hamilton path</dc:subject><dc:subject>automorphism group</dc:subject><dc:description>It is shown that every connected vertex-transitive graph of order ▫$6p$▫, where ▫$p$▫ is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the Petersen graph, every connected vertex-transitive graph of order ▫$6p$▫ which is not genuinely imprimitive contains a Hamilton cycle.</dc:description><dc:date>2009</dc:date><dc:date>2013-10-15 12:08:06</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>3085</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
