{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T01:59:24Z","timestamp":1787363964295,"version":"build-2736575974"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>We show that every 2-edge-connected cubic graph $G$ not isomorphic to the Petersen graph has a 2-factor with at most 2(n-2)\/15 circuits of length 5, where $n$ is the number of vertices of $G$. We construct an infinite family of graphs, for which this bound is tight, and improve the bound to n\/10 for cyclically 4-edge-connected cubic graphs of girth at least 5. We also show that $G$ has a $2$-factor with at most $n\/5.8\\overline{3}$ odd circuits.<\/jats:p>","DOI":"10.1137\/130942966","type":"journal-article","created":{"date-parts":[[2015,8,6]],"date-time":"2015-08-06T15:09:19Z","timestamp":1438873759000},"page":"1387-1405","source":"Crossref","is-referenced-by-count":1,"title":["Avoiding 5-Circuits in 2-Factors of Cubic Graphs"],"prefix":"10.1137","volume":"29","author":[{"given":"Barbora","family":"Candr\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Lukot'ka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,8,6]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0620-1"},{"key":"atypb2","unstructured":"M. DeVos,\n                      Petersen Graph Conjecture - Not Too Hard\n                      , http:\/\/garden.irmacs.sfu.ca\/?q=op\/petersen_graph_conjecture (2007)."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.11.003"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00126-2"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1029"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2009.12.001"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2009.10.003"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.194.abe"},{"key":"atypb10","unstructured":"F. Jaeger,\n                      Nowhere-zero flow problems\n                      , in Selected Topics in Graph Theory 3, L. W. Beineke and R. J. Wilson, eds., Academic, San Diego, CA, 1988, pp. 71-95."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.05.026"},{"key":"atypb12","doi-asserted-by":"crossref","first-page":"P1","DOI":"10.37236\/4265","volume":"22","author":"Lukot'ka R.","year":"2015","journal-title":"Electron. J. Combin."},{"key":"atypb13","unstructured":"V. V. Mkrtchyan and S. S. Petrosyan,\n                      Petersen Graph Conjecture\n                      , http:\/\/garden.irmacs.sfu.ca\/?q=op\/petersen_graph_conjecture (2007)."},{"key":"atypb14","first-page":"1129","author":"Watkins J. J.","year":"1991","journal-title":"New York"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/130942966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:17:51Z","timestamp":1787318271000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/130942966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/130942966"],"URL":"https:\/\/doi.org\/10.1137\/130942966","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}