<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-HEC9RIXY</identifier><date>1993</date><creator>Žerovnik, Janez</creator><relation>documents/doc/H/URN_NBN_SI_doc-HEC9RIXY_001.pdf</relation><relation>documents/doc/H/URN_NBN_SI_doc-HEC9RIXY_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. 59-63</format><identifier identifier_type="ISSN">0350-5596</identifier><identifier identifier_type="COBISSID">4702468</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-HEC9RIXY</identifier><language>eng</language><publisher>Slovensko društvo Informatika</publisher><source>Informatica (Ljubljana)</source><rights>InC</rights><subject language_type_id="slv">barvanje grafa</subject><subject language_type_id="eng">computer science</subject><subject language_type_id="slv">matematika</subject><subject language_type_id="eng">mathematics</subject><subject language_type_id="slv">računalništvo</subject><subject language_type_id="slv">teorija grafov</subject><title>Regular graphs are 'difficult' for colouring</title></Record>