<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-GDLZJWSV</identifier><date>2022</date><creator>Jorgensen, Leif K.</creator><creator>Pineda-Villavicencio, Guillermo</creator><creator>Ugon, Julien</creator><relation>documents/doc/G/URN_NBN_SI_doc-GDLZJWSV_001.pdf</relation><relation>documents/doc/G/URN_NBN_SI_doc-GDLZJWSV_001.txt</relation><format format_type="issue">2</format><format format_type="volume">22</format><format format_type="type">article</format><format format_type="extent">P2.09 (10 str.)</format><identifier identifier_type="DOI">10.26493/1855-3974.2577.25d</identifier><identifier identifier_type="COBISSID_HOST">117087235</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-GDLZJWSV</identifier><language>eng</language><publisher publisher_location="Koper">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="eng">Cartesian product</subject><subject language_type_id="slv">ciklični politop</subject><subject language_type_id="eng">connectivity</subject><subject language_type_id="eng">cyclic polytope</subject><subject language_type_id="eng">dual polytope</subject><subject language_type_id="slv">dualni politop</subject><subject language_type_id="slv">kartezični produkt</subject><subject language_type_id="eng">k-linked</subject><subject language_type_id="slv">k-vezan</subject><subject language_type_id="eng">linkedness</subject><subject language_type_id="slv">povezljivost</subject><subject language_type_id="slv">vezanost</subject><title>Linkedness of Cartesian products of complete graphs</title></Record>