<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-2WJKTX2X</identifier><date>2013</date><creator>Schiermeyer, Ingo</creator><relation>documents/casopisje/ars-mathematica-contemporanea/16470361a.pdf</relation><relation>documents/doc/2/URN_NBN_SI_doc-2WJKTX2X_001.pdf</relation><relation>documents/doc/2/URN_NBN_SI_doc-2WJKTX2X_001.txt</relation><format format_type="issue">1</format><format format_type="volume">6</format><format format_type="type">article</format><format format_type="extent">str. 83-88</format><identifier identifier_type="COBISSID">16470361</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-2WJKTX2X</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">edge colouring</subject><subject language_type_id="eng">graph theory</subject><subject language_type_id="eng">rainbow subgraph</subject><subject language_type_id="slv">teorija grafov</subject><title>On the minimum rainbow subgraph number of a graph</title></Record>