<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-LTW1PK5C</identifier><date>2015</date><creator>Huggett, Stephen</creator><creator>Tawfik, Israa</creator><relation>documents/doc/L/URN_NBN_SI_doc-LTW1PK5C_001.pdf</relation><relation>documents/doc/L/URN_NBN_SI_doc-LTW1PK5C_001.txt</relation><format format_type="issue">2</format><format format_type="volume">8</format><format format_type="type">article</format><format format_type="extent">str. 319-335</format><identifier identifier_type="COBISSID">17377113</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-LTW1PK5C</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="eng">components of links</subject><subject language_type_id="eng">embedded graphs</subject><subject language_type_id="slv">komponente povezavnih diagramov</subject><subject language_type_id="slv">medial</subject><subject language_type_id="slv">vloženi grafi</subject><title>Embedded graphs whose links have the largest possible number of components</title></Record>