<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-ZC58691H</identifier><date>2016</date><creator>Behmaram, Afshin</creator><creator>Došlić, Tomislav</creator><creator>Friedland, Shmuel</creator><relation>documents/doc/Z/URN_NBN_SI_doc-ZC58691H_001.pdf</relation><relation>documents/doc/Z/URN_NBN_SI_doc-ZC58691H_001.txt</relation><format format_type="volume">11</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 301-313</format><identifier identifier_type="COBISSID">17858137</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-ZC58691H</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">fulerenski graf</subject><subject language_type_id="eng">fullerene graph</subject><subject language_type_id="eng">Hadamard-Fischer inequality</subject><subject language_type_id="slv">Hadamard-Fischerjeva neenakost</subject><subject language_type_id="eng">perfect matching</subject><subject language_type_id="eng">Pfaffian graph</subject><subject language_type_id="slv">Pfaffov graph</subject><subject language_type_id="slv">popolno prirejanje</subject><title>Matchings in m-generalized fullerene graphs</title></Record>