<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-BC8FDUQA</identifier><date>2016</date><creator>Goff, Michael</creator><relation>documents/doc/B/URN_NBN_SI_doc-BC8FDUQA_001.pdf</relation><relation>documents/doc/B/URN_NBN_SI_doc-BC8FDUQA_001.txt</relation><format format_type="issue">1</format><format format_type="volume">10</format><format format_type="type">article</format><format format_type="extent">str. 45-66</format><identifier identifier_type="COBISSID">17732953</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-BC8FDUQA</identifier><language>eng</language><publisher>Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="eng">combinatorial species</subject><subject language_type_id="eng">complete multipartite graph</subject><subject language_type_id="eng">distinguishing partition</subject><subject language_type_id="slv">kombinatorične vrste</subject><subject language_type_id="slv">polni multipartitni graf</subject><subject language_type_id="slv">preštevanje dreves</subject><subject language_type_id="slv">razlikovalna particija</subject><subject language_type_id="eng">tree enumeration</subject><title>Distinguishing partitions of complete multipartite graphs</title></Record>