<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-FA41EGJV</identifier><date>2011</date><creator>Fijavž, Gašper</creator><creator>Negami, Seiya</creator><creator>Terukazu, Sano</creator><relation>documents/casopisje/ars-mathematica-contemporanea/16089689a.pdf</relation><relation>documents/doc/F/URN_NBN_SI_doc-FA41EGJV_001.pdf</relation><relation>documents/doc/F/URN_NBN_SI_doc-FA41EGJV_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. 165-175</format><identifier identifier_type="COBISSID">16089689</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-FA41EGJV</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">3-connected graphs</subject><subject language_type_id="slv">3-povezani grafi</subject><subject language_type_id="eng">distinguishing chromatic number</subject><subject language_type_id="eng">distinguishing coloring</subject><subject language_type_id="eng">graph theory</subject><subject language_type_id="eng">planar graphs</subject><subject language_type_id="slv">ravninski grafi</subject><subject language_type_id="slv">razlikovalno barvanje</subject><subject language_type_id="slv">teorija grafov</subject><title>3-Connected planar graphs are 5-distinguishing colorable with two exceptions</title></Record>