{"?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-PJ9WFIPG/01a76411-7229-4798-a271-5690f27a392d/PDF","dcterms:extent":"222 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-PJ9WFIPG/bd4f974a-8485-49fa-88f0-b39130913b0f/TEXT","dcterms:extent":"21 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-PJ9WFIPG","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":"Wang, Tao","dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:8"},{"@xml:lang":"sl","#text":"str. 409-416"}],"dc:identifier":["COBISSID:17379161","ISSN:1855-3966","URN:URN:NBN:SI:doc-PJ9WFIPG"],"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":"grafi"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Strongly light subgraphs in the 1-planar graphs with minimum degree 7|"},"dc:description":[{"@xml:lang":"sl","#text":"A graph is 1-planar if it can be drawn in the plane such that every edge crosses at most one other edge. A connected graph ?$H$? is strongly light in a family of graphs ?$\\mathfrak{G}$?, if there exists a constant ?$\\lambda$?, such that every graph ?$G$? in ?$\\mathfrak{G}$? contains a subgraph ?$K$? isomorphic to ?$H$? with ?$\\text{deg}_G(v) \\le \\lambda$? for all ?$v \\in V(K)$?. In this paper, we present some strongly light subgraphs in the family of 1-planar graphs with minimum degree 7"},{"@xml:lang":"sl","#text":"Graf se imenuje 1-planaren, če ga lahko narišemo v ravnini tako, da vsaka povezava seka največ eno drugo povezavo. Povezan graf ?$H$? se imenuje krepko lahek v družini grafov ?$\\mathfrak{G}$?, če obstaja konstanta ?$\\lambda$?, tako da vsak graf ?$G$? iz ?$\\mathfrak{G}$? vsebuje podgraf ?$K$? izomorfen ?$H$?, v katerem je ?$\\text{deg}_G(v) \\le \\lambda$? za vsa vozlišča ?$v \\in V(K)$?. V tem članku predstavimo nekaj krepko lahkih podgrafov v družini 1-planarnih grafov z minimalno stopnjo 7"}],"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-PJ9WFIPG","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-PJ9WFIPG"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-PJ9WFIPG/01a76411-7229-4798-a271-5690f27a392d/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-PJ9WFIPG/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-PJ9WFIPG"}}}}