<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-E8D7Z5KO</identifier><date>2019</date><creator>Przybyło, Jakub</creator><relation>documents/doc/E/URN_NBN_SI_doc-E8D7Z5KO_001.pdf</relation><relation>documents/doc/E/URN_NBN_SI_doc-E8D7Z5KO_001.txt</relation><format format_type="issue">1</format><format format_type="volume">17</format><format format_type="type">article</format><format format_type="extent">str. 37-49</format><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="COBISSID_HOST">18911833</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-E8D7Z5KO</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">adjacent strong chromatic index</subject><subject language_type_id="eng">distant set distinguishing index</subject><subject language_type_id="eng">distant sum distinguishing index of a graph</subject><subject language_type_id="eng">neighbour sum distinguishing index</subject><subject language_type_id="slv">razlikovalni indeks oddaljenih množic</subject><subject language_type_id="slv">razlikovalni indeks oddaljenih vsot</subject><subject language_type_id="slv">razlikovalni indeks sosednjih vsot</subject><subject language_type_id="slv">sosedni krepki kromatični indeks</subject><title>Distant sum distinguishing index of graphs with bounded minimum degree</title></Record>