<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-VB1IZ287</identifier><date>2009</date><creator>Petkovšek, Marko</creator><creator>Zakrajšek, Helena</creator><relation>documents/casopisje/ars-mathematica-contemporanea/15497049a.pdf</relation><relation>documents/doc/V/URN_NBN_SI_doc-VB1IZ287_001.pdf</relation><relation>documents/doc/V/URN_NBN_SI_doc-VB1IZ287_001.txt</relation><format format_type="issue">2</format><format format_type="volume">2</format><format format_type="type">article</format><format format_type="extent">str. 241-262</format><identifier identifier_type="COBISSID">15497049</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-VB1IZ287</identifier><language>eng</language><publisher>Društvo matematikov, fizikov in astronomov Slovenije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="slv">kombinatorika</subject><subject language_type_id="slv">matematika</subject><subject language_type_id="slv">teorija grafov</subject><title>Enumeration of I-graphs: Burnside does it again</title></Record>