{"?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-ZUC1LCEX/8de4ecd4-6d68-4a39-b4ec-662e3e399325/PDF","dcterms:extent":"469 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-ZUC1LCEX/68b1cee6-8e25-4f7c-88dc-3f4113bad171/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-ZUC1LCEX","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2014","dc:creator":["Liu, Guizhen","Zhang, Xin"],"dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:7"},{"@xml:lang":"sl","#text":"str. 281-291"}],"dc:identifier":["COBISSID:17046105","ISSN:1855-3966","URN:URN:NBN:SI:doc-ZUC1LCEX"],"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":"en","#text":"cycle"},{"@xml:lang":"en","#text":"discharging"},{"@xml:lang":"en","#text":"lightness"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree|"},"dc:description":{"@xml:lang":"sl","#text":"A graph ?$G$? is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. The family of 1-planar graphs with minimum vertex degree at least ?$\\delta$? and minimum edge degree at least ?$\\varepsilon$? is denoted by ?$\\mathcal{P}_\\delta^1(\\varepsilon)$?. In this paper, it is proved that every graph in ?$\\mathcal{P}_7^1(14)$? (resp. ?$\\mathcal{P}_6^1(13)$?) contains a copy of chordal 4-cycle with all vertices of degree at most 10 (resp. 12)"},"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-ZUC1LCEX","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-ZUC1LCEX"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-ZUC1LCEX/8de4ecd4-6d68-4a39-b4ec-662e3e399325/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-ZUC1LCEX/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-ZUC1LCEX"}}}}