<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-V9D75SDV/3afe8bd7-ae65-4d63-a0fe-5bf673334dc8/PDF"><dcterms:extent>1673 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-V9D75SDV/db10e1cb-3de8-43a8-8f70-d6f495aa4702/TEXT"><dcterms:extent>34 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-V9D75SDV"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2022</dcterms:issued><dc:creator>Jin, Xian'an</dc:creator><dc:creator>Yan, Qi</dc:creator><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">letnik:22</dc:format><dc:format xml:lang="sl">P2.06 (16 str.)</dc:format><dc:identifier>DOI:10.26493/1855-3974.2053.c7b</dc:identifier><dc:identifier>COBISSID_HOST:116452099</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-V9D75SDV</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="sl">A-tir</dc:subject><dc:subject xml:lang="en">A-trails</dc:subject><dc:subject xml:lang="en">checkerboard colourable</dc:subject><dc:subject xml:lang="en">embedded graphs</dc:subject><dc:subject xml:lang="en">Eulerian</dc:subject><dc:subject xml:lang="sl">Eulerjev obhod</dc:subject><dc:subject xml:lang="sl">šahovnično pobarvljiv</dc:subject><dc:subject xml:lang="en">twisted duals</dc:subject><dc:subject xml:lang="sl">vloženi grafi</dc:subject><dc:subject xml:lang="sl">zasukani duali</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">A-trails of embedded graphs and twisted duals|</dc:title><dc:description xml:lang="sl">Kotzig showed that every connected 4-regular plane graph has an ?$A$?-trail -- an Eulerian circuit that turns either left or right at each vertex. However, this statement is not true for Eulerian plane graphs and determining if an Eulerian plane graph has an ?$A$?-trail is NP-hard. The aim of this paper is to give a characterization of Eulerian embedded graphs having an ?$A$?-trail. Andersen et al. showed the existence of orthogonal pairs of ?$A$?-trails in checkerboard colourable 4-regular graphs embedded on the plane, torus and projective plane. A problem posed in their paper is to characterize Eulerian embedded graphs (not necessarily checkerboard colourable) which contain two orthogonal ?$A$?-trails. In this article, we solve this problem in terms of twisted duals. Several related results are also obtained</dc:description><dc:description xml:lang="sl">Kotzig je dokazal, da ima vsak povezan 4-regularen ravninski graf ?$A$?-tir: Eulerjev obhod, ki v vsakem vozlišču zavije bodisi levo bodisi desno. Ta ugotovitev pa ne drži za Eulerjeve ravninske grafe, in ugotavljanje, ali ima neki Eulerjev ravninski graf ?$A$?-tir, je NP-težak problem. Cilj tega članka je karakterizirati tiste Eulerjeve vložene grafe, ki imajo ?$A$?-tir. Andersen in dr. so dokazali obstoj ortogonalnih parov ?$A$?-tirov v šahovnično pobarvljivih 4-regularnih grafih, vloženih v ravnino, torus in projektivno ravnino. V svojem članku so zastavili problem karakterizacije Eulerjevih vloženih grafov (ne nujno šahovnično pobarvljivih), ki vsebujejo dva pravokotna ?$A$?-tira. V tem članku ta problem rešimo s pomočjo zasukanih dualov. Na ta način dobimo še nekaj sorodnih rezultatov</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-V9D75SDV"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-V9D75SDV" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-V9D75SDV/3afe8bd7-ae65-4d63-a0fe-5bf673334dc8/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-V9D75SDV/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-V9D75SDV" /></ore:Aggregation></rdf:RDF>