<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-V2Z5F9ZG</identifier><date>2015</date><creator>Dupuis, Michael</creator><creator>Wagon, Stan</creator><relation>documents/doc/V/URN_NBN_SI_doc-V2Z5F9ZG_001.pdf</relation><relation>documents/doc/V/URN_NBN_SI_doc-V2Z5F9ZG_001.txt</relation><format format_type="issue">1</format><format format_type="volume">9</format><format format_type="type">article</format><format format_type="extent">str. 115-124</format><identifier identifier_type="COBISSID">17584985</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-V2Z5F9ZG</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">generalized Petersen graphs</subject><subject language_type_id="slv">graf skakačevih skokov</subject><subject language_type_id="eng">Hamilton-connected</subject><subject language_type_id="eng">Hamiltonian paths</subject><subject language_type_id="eng">Hamilton-laceable</subject><subject language_type_id="slv">Hamiltonove poti</subject><subject language_type_id="slv">hamiltonsko-povezan</subject><subject language_type_id="slv">hamiltonsko-premostljiv</subject><subject language_type_id="eng">knight graph</subject><subject language_type_id="slv">posplošeni Petersenovi grafi</subject><subject language_type_id="slv">sledljiv</subject><subject language_type_id="eng">traceable</subject><title>Laceable knights</title></Record>