<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-RW379VPB</identifier><date>2017</date><creator>Yuan, Long-Tu</creator><creator>Zhang, Xiao-Dong</creator><relation>documents/doc/R/URN_NBN_SI_doc-RW379VPB_001.pdf</relation><relation>documents/doc/R/URN_NBN_SI_doc-RW379VPB_001.txt</relation><format format_type="issue">1</format><format format_type="volume">13</format><format format_type="type">article</format><format format_type="extent">str. 49-61</format><identifier identifier_type="COBISSID">18173785</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-RW379VPB</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="slv">drevo</subject><subject language_type_id="slv">Erdős-Sósova domneva</subject><subject language_type_id="slv">maksimalna stopnja</subject><subject language_type_id="slv">teorija grafov</subject><title>On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices</title></Record>