<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-050QJIMQ</identifier><date>2016</date><creator>Furmańczyk, Hanna</creator><creator>Kubale, Marek</creator><relation>documents/doc/0/URN_NBN_SI_doc-050QJIMQ_001.pdf</relation><relation>documents/doc/0/URN_NBN_SI_doc-050QJIMQ_001.txt</relation><format format_type="volume">10</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 333-347</format><identifier identifier_type="COBISSID">17834585</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-050QJIMQ</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">corona graph</subject><subject language_type_id="eng">cubic graph</subject><subject language_type_id="eng">equitable chromatic number</subject><subject language_type_id="eng">equitable graph coloring</subject><subject language_type_id="slv">kronski graf</subject><subject language_type_id="slv">kubični graf</subject><subject language_type_id="slv">nepristransko barvanje</subject><subject language_type_id="slv">nepristransko kromatsko število</subject><subject language_type_id="eng">NP-hardness</subject><subject language_type_id="slv">NP-težko</subject><subject language_type_id="slv">polinomski algoritem</subject><subject language_type_id="eng">polynomial algorithm</subject><title>Equitable coloring of corona products of cubic graphs is harder than ordinary coloring</title></Record>