<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-ROW7W1J5</identifier><date>2011</date><creator>Ellingham, Mark N.</creator><creator>Schroeder, Justin Z.</creator><relation>documents/casopisje/ars-mathematica-contemporanea/16264793a.pdf</relation><relation>documents/doc/R/URN_NBN_SI_doc-ROW7W1J5_001.pdf</relation><relation>documents/doc/R/URN_NBN_SI_doc-ROW7W1J5_001.txt</relation><format format_type="issue">1</format><format format_type="volume">4</format><format format_type="type">article</format><format format_type="extent">str. 111-123</format><identifier identifier_type="COBISSID">16264793</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-ROW7W1J5</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="eng">asymmetric uniform hypergraph</subject><subject language_type_id="eng">complete equipartite graph</subject><subject language_type_id="eng">distinguishing number</subject><subject language_type_id="eng">distinguishing partition</subject><subject language_type_id="eng">graph theory</subject><subject language_type_id="slv">razlikovalna particija</subject><subject language_type_id="slv">razlikovalno število</subject><subject language_type_id="slv">teorija grafov</subject><title>Distinguishing partitions and asymmetric uniform hypergraphs</title></Record>