{"?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-F406JBN4/bebb27be-058a-40a5-91d5-6215fb1776fd/PDF","dcterms:extent":"315 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-F406JBN4/ace71d3d-2986-46ea-83ea-d2d60ce378ca/TEXT","dcterms:extent":"13 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-F406JBN4","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2017","dc:creator":"Yang, Yan","dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:12"},{"@xml:lang":"sl","#text":"str. 135-144"}],"dc:identifier":["COBISSID:18095961","ISSN:1855-3966","URN:URN:NBN:SI:doc-F406JBN4"],"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":"debelina"},{"@xml:lang":"sl","#text":"grafi"},{"@xml:lang":"sl","#text":"polni tridelni graf"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Remarks on the thickness of Ksub{n, n, n}|"},"dc:description":[{"@xml:lang":"sl","#text":"The thickness ?$\\theta(G)$? of a graph ?$G$? is the minimum number of planar subgraphs into which ?$G$? can be decomposed. In this paper, we provide a new upper bound for the thickness of the complete tripartite graphs ?$K_{n, n, n} \\; (n \\ge 3)$? and obtain ?$\\theta(K_{n, n, n}) = \\lceil \\frac{n+1}{3}\\rceil$?, when ?$n \\equiv 3 \\pmod{6}$?"},{"@xml:lang":"sl","#text":"Debelina ?$\\theta(G)$? grafa ?$G$? je minimalno število ravninskih podgrafov, v katere lahko dekomponiramo graf ?$G$?. V tem članku podamo novo zgornjo mejo za debelino polnih tridelnih grafov ?$K_{n, n, n} \\; (n \\ge 3)$?, pokažemo tudi, da je ?$\\theta(K_{n, n, n}) = \\lceil \\frac{n+1}{3}\\rceil$?, ko je ?$n\\equiv 3 \\pmod{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-F406JBN4","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-F406JBN4"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-F406JBN4/bebb27be-058a-40a5-91d5-6215fb1776fd/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-F406JBN4/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-F406JBN4"}}}}