{"?xml":{"@version":"1.0"},"edm: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-FJ9ESYSG/CACACCD4-F8FA-474F-AC60-539ECCDB539C/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-FJ9ESYSG/0ab1c632-6bf0-4095-bd4d-fd75a990af3f/PDF","dcterms:extent":"435 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-FJ9ESYSG/7afa0012-1588-486d-be2c-33b129952fbf/TEXT","dcterms:extent":"37 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-FJ9ESYSG","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2011","dc:creator":["Czap, Július","Jendrol, Stanislav","Kardoš, František"],"dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:4"},{"@xml:lang":"sl","#text":"str. 255-268"}],"dc:identifier":["COBISSID:16267097","ISSN:1855-3966","URN:URN:NBN:SI:doc-FJ9ESYSG"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"sl","#text":"barvanje povezav"},{"@xml:lang":"en","#text":"edge colouring"},{"@xml:lang":"en","#text":"facial walk"},{"@xml:lang":"en","#text":"graph theory"},{"@xml:lang":"en","#text":"plane graphs"},{"@xml:lang":"sl","#text":"ravninski grafi"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Facial parity edge colouring|"},"dc:description":{"@xml:lang":"sl","#text":"A facial parity edge colouring of a connected bridgeless plane graph is an edge colouring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same colour, in addition, for each face $\\alpha$ and each colour $c$, either no edge or an odd number of edges incident with $\\alpha$ is coloured with $c$. From Vizing's theorem it follows that every 3-connected plane graph has a such colouring with at most $\\Delta^\\ast + 1$ colours, where $\\Delta^\\ast$ is the size of the largest face. In this paper we prove that any connected bridgeless plane graph has a facial parity edge colouring with at most 92 colours"},"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-FJ9ESYSG","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-FJ9ESYSG"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-FJ9ESYSG/CACACCD4-F8FA-474F-AC60-539ECCDB539C/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-FJ9ESYSG/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-FJ9ESYSG"}}}}