<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-3578U9KZ</identifier><date>2011</date><creator>Kostochka, Alexandr V.</creator><creator>Stocker, C.</creator><relation>documents/casopisje/ars-mathematica-contemporanea/16266073a.pdf</relation><relation>documents/doc/3/URN_NBN_SI_doc-3578U9KZ_001.pdf</relation><relation>documents/doc/3/URN_NBN_SI_doc-3578U9KZ_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. 153-164</format><identifier identifier_type="COBISSID">16266073</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-3578U9KZ</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="slv">aciklično barvanje</subject><subject language_type_id="eng">acyclic coloring</subject><subject language_type_id="eng">graph theory</subject><subject language_type_id="slv">maksimalna stopnja</subject><subject language_type_id="eng">maximum degree</subject><subject language_type_id="slv">teorija grafov</subject><title>Graphs with maximum degree 5 are acyclically 7-colorable</title></Record>