{"?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-33QAQ7O6/8b171f26-2bcf-4333-afcc-09768303a874/PDF","dcterms:extent":"351 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-33QAQ7O6/092cdabe-d59c-4c5b-811e-42993cc3eb4d/TEXT","dcterms:extent":"39 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-33QAQ7O6","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2016","dc:creator":["Li, Xiangwen","Ma, Jianqing"],"dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:11"},{"@xml:lang":"sl","#text":"str. 35-47"}],"dc:identifier":["COBISSID:17836377","ISSN:1855-3966","URN:URN:NBN:SI:doc-33QAQ7O6"],"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":"Zsub3-connectivity of Ksub{1,3}-free graphs without induced cycle of length at least 5|"},"dc:description":[{"@xml:lang":"sl","#text":"F. Jaeger et al. J. Comb. Theory, Ser. B 56, No. 2, 165--182 (1992) conjectured that every 5-edge-connected graph is ?$Z_3$?-connected. In this paper, we prove that every 4-edge-connected ?$K_{1,3}$?-free graph without any induced cycle of length at least 5 is ?$Z_3$?-connected, which partially generalizes the earlier results of H.-J. Lai Graphs Comb. 16, No. 2, 165--176 (2000) and T. Fukunaga Graphs Comb. 27, No. 5, 647--659 (2011)"},{"@xml:lang":"sl","#text":"Jaeger in soavtorji J. Comb. Theory, Ser. B 56, No. 2, 165--182 (1992) so domnevali, da je vsak 5-povezavnopovezan graf ?$Z_3$?-povezan. V tem članku dokažemo, da je vsak 4-povezavno-povezan ?$K_{1,3}$?-prost graf brez induciranega cikla dolžine najmanj 5 ?$Z_3$?-povezan, kar je delna posplošitev prejšnjih rezultatov: Lai Graphs and Combin. 16 (2000) 165-176 in Fukunaga Graphs and Combin. 27 (2011) 647-659"}],"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-33QAQ7O6","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:DOC-33QAQ7O6"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:DOC-33QAQ7O6/8b171f26-2bcf-4333-afcc-09768303a874/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-33QAQ7O6/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:DOC-33QAQ7O6"}}}}