{"?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-ZBN4M3VA/6a43d20f-2b6a-480c-aa05-87e06e78f9a0/PDF","dcterms:extent":"268 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-ZBN4M3VA/8b816b47-f87f-402d-9b98-8bcf8deefce5/TEXT","dcterms:extent":"16 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-ZBN4M3VA","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2015","dc:creator":"Czap, Július","dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:9"},{"@xml:lang":"sl","#text":"str. 279-286"}],"dc:identifier":["COBISSID:17608025","ISSN:1855-3966","URN:URN:NBN:SI:doc-ZBN4M3VA"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"sl","#text":"barvanje povezav"},{"@xml:lang":"en","#text":"edge coloring"},{"@xml:lang":"en","#text":"plane graph"},{"@xml:lang":"sl","#text":"ravninski graf"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Edge looseness of plane graphs|"},"dc:description":[{"@xml:lang":"sl","#text":"A face of an edge colored plane graph is called e-loose if the number of colors used on its edges is at least three. The e-looseness of a plane graph ?$G$? is the minimum positive integer ?$k$? such that any edge coloring of ?$G$? with ?$k$? colors involves an e-loose face. In this paper we determine tight lower and upper bounds for the e-looseness of connected plane graphs. These bounds are expressed by linear polynomials of the number of faces"},{"@xml:lang":"sl","#text":"Lice povezavno pobarvanega ravninskega grafa se imenuje e-rahlo, če so njegove stranice pobarvane z najmanj tremi barvami; e-rahlost ravninskega grafa ?$G$? pa je najmanjše naravno število ?$k$?, pri katerem vsako barvanje povezav grafa ?$G$? s ?$k$? barvami vsebuje e-rahlo lice. V tem članku določimo tesno spodnjo in zgornjo mejo za e-rahlost povezanih ravninskih grafov. Ti meji se izražata z linearnima polinomoma v številu lic"}],"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-ZBN4M3VA","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-ZBN4M3VA"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-ZBN4M3VA/6a43d20f-2b6a-480c-aa05-87e06e78f9a0/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-ZBN4M3VA/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-ZBN4M3VA"}}}}