<?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>Enumerating graphs via even/odd dichotomy</dc:title><dc:creator>Hujdurović,	Ademir	(Avtor)
	</dc:creator><dc:creator>Kutnar,	Klavdija	(Avtor)
	</dc:creator><dc:creator>Marušič,	Dragan	(Avtor)
	</dc:creator><dc:subject>odd automorphism</dc:subject><dc:subject>even automorphism</dc:subject><dc:subject>automorphism group</dc:subject><dc:subject>vertex-transitive graph</dc:subject><dc:date>2018</dc:date><dc:date>2018-04-17 08:49:29</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>9586</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 0166-218X</dc:identifier><dc:identifier>OceCobissID: 25342464</dc:identifier><dc:identifier>DOI: 10.1016/j.dam.2018.03.047</dc:identifier><dc:identifier>COBISS.SI-ID: 1540253636</dc:identifier><dc:language>sl</dc:language></metadata>
