{"?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-WOKLZW4P/C8ED5287-7DBF-4BEA-B610-6F1887BF1776/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-WOKLZW4P/a2611ab5-da10-4e49-914f-50a69d78395e/PDF","dcterms:extent":"253 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-WOKLZW4P/b25b4b0c-ba32-4991-a787-04422dbb15a3/TEXT","dcterms:extent":"30 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-WOKLZW4P","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":["Hudák, Dávid","Madaras, Tomáš"],"dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:4"},{"@xml:lang":"sl","#text":"str. 245-254"}],"dc:identifier":["COBISSID:16266841","ISSN:1855-3966","URN:URN:NBN:SI:doc-WOKLZW4P"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"en","#text":"1-planar graph"},{"@xml:lang":"sl","#text":"1-ravninski grafi"},{"@xml:lang":"en","#text":"graph theory"},{"@xml:lang":"sl","#text":"lahki grafi"},{"@xml:lang":"en","#text":"light graph"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"On local properties of 1-planar graphs with high minimum degree|"},"dc:description":{"@xml:lang":"sl","#text":"A graph is called 1-planar if there exists its drawing in the plane such that each edge contains at most one crossing. We prove that each 1-planar graph of minimum degree 7 contains a pair of adjacent vertices of degree 7 as well as several small graphs whose vertices have small degrees; we also prove the existence of a 4-cycle with relatively small degree vertices in 1-planar graphs of minimum degree at least 6"},"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-WOKLZW4P","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-WOKLZW4P"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-WOKLZW4P/C8ED5287-7DBF-4BEA-B610-6F1887BF1776/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-WOKLZW4P/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-WOKLZW4P"}}}}