<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Arc-transitive cycle decompositions of tetravalent graphs</dc:title><dc:creator>Miklavič,	Štefko	(Avtor)
	</dc:creator><dc:creator>Potočnik,	Primož	(Avtor)
	</dc:creator><dc:creator>Wilson,	Steve	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>cycle decomposition</dc:subject><dc:subject>automorphism group</dc:subject><dc:subject>consistent cycle</dc:subject><dc:subject>medial maps</dc:subject><dc:description>A cycle decomposition of a graph ▫$\Gamma$▫ is a set ▫$\mathcal{C}$▫ of cycles of ▫$\Gamma$▫ such that every edge of ▫$\Gamma$▫ belongs to exactly one cycle in ▫$\mathcal{C}$▫. Such a decomposition is called arc-transitive if the group of automorphisms of ▫$\Gamma$▫ that preserve setwise acts transitively on the arcs of ▫$\Gamma$▫. In this paper, we study arc-transitive cycle decompositions of tetravalent graphs. In particular, we are interested in determining and enumerating arc-transitive cycle decompositions admitted by a given arc-transitive tetravalent graph. Among other results we show that a connected tetravalent arc-transitive graph is either 2-arc-transitive, or is isomorphic to the medial graph of a reflexible map, or admits exactly one cycle structure.</dc:description><dc:date>2008</dc:date><dc:date>2013-10-15 12:09:20</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>3883</dc:identifier><dc:identifier>ISSN: 0095-8956</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>COBISS.SI-ID: 14627417</dc:identifier><dc:language>sl</dc:language></metadata>
