{"?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-9SLQ582U/C7134241-7DAA-4177-A8B5-A5661969F81A/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-9SLQ582U/4496d2e0-0572-4cf8-b99b-8e9f4fd0b020/PDF","dcterms:extent":"280 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-9SLQ582U/360b4dc7-4e02-4ad8-870d-04d8dc2b7336/TEXT","dcterms:extent":"47 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-9SLQ582U","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":["Kündgen, André","Richter, R. Bruce"],"dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:4"},{"@xml:lang":"sl","#text":"str. 79-93"}],"dc:identifier":["COBISSID:16263257","ISSN:1855-3966","URN:URN:NBN:SI:doc-9SLQ582U"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"en","#text":"2-factor"},{"@xml:lang":"sl","#text":"2-faktor"},{"@xml:lang":"en","#text":"cubic graph"},{"@xml:lang":"sl","#text":"dolg cikel"},{"@xml:lang":"en","#text":"graph theory"},{"@xml:lang":"en","#text":"infinite graph"},{"@xml:lang":"sl","#text":"kubični grafi"},{"@xml:lang":"en","#text":"long cycle"},{"@xml:lang":"sl","#text":"neskončen graf"},{"@xml:lang":"sl","#text":"snark"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"On 2-factors with long cycles in cubic graphs|"},"dc:description":{"@xml:lang":"sl","#text":"Every 2-connected cubic graph ?$G$? has a 2-factor, and much effort has gone into studying conditions that guarantee ?$G$? to be Hamiltonian. We show that if ?$G$? is not Hamiltonian, then ?$G$? is either the Petersen graph or contains a 2-factor with a cycle of length at least 7. We also give infinite families of, respectively, 2- and 3-connected cubic graphs in which every 2-factor consists of cycles of length at most, respectively, 10 and 16"},"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-9SLQ582U","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-9SLQ582U"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-9SLQ582U/C7134241-7DAA-4177-A8B5-A5661969F81A/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-9SLQ582U/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-9SLQ582U"}}}}