<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-48YX15AG</identifier><date>2018</date><creator>Hou, Jianfeng</creator><creator>Zeng, Qinghou</creator><relation>documents/doc/4/URN_NBN_SI_doc-48YX15AG_001.pdf</relation><relation>documents/doc/4/URN_NBN_SI_doc-48YX15AG_001.txt</relation><format format_type="issue">1</format><format format_type="volume">15</format><format format_type="type">article</format><format format_type="extent">str. 147-160</format><identifier identifier_type="COBISSID">18485593</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-48YX15AG</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">grafi</subject><subject language_type_id="slv">maksimalni prerez</subject><subject language_type_id="slv">particija</subject><title>Maximum cuts of graphs with forbidden cycles</title></Record>