{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T13:23:48Z","timestamp":1767014628901,"version":"3.48.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00493-025-00191-x","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:58:19Z","timestamp":1765529899000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bound on Shortest Cycle Covers"],"prefix":"10.1007","volume":"45","author":[{"given":"Deping","family":"Song","sequence":"first","affiliation":[]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"191_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s003730200002","volume":"1","author":"N Alon","year":"2002","unstructured":"Alon, N., Hoory, S., Linial, N.: The Moore bound for irregular graphs. Graphs Combin. 1, 53\u201357 (2002)","journal-title":"Graphs Combin."},{"key":"191_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0606035","volume":"6","author":"N Alon","year":"1985","unstructured":"Alon, N., Tarsi, M.: Covering multigraphs by simple circuits. SIAM J. Algebraic Discrete Methods. 6, 345\u2013350 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods."},{"key":"191_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0095-8956(83)90056-4","volume":"35","author":"JC Bermond","year":"1983","unstructured":"Bermond, J.C., Jackson, B., Jaeger, F.: Shortest coverings of graphs with cycles. J. Combin. Theory Ser. B 35, 297\u2013308 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"191_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory. Springer (2008)"},{"issue":"4","key":"191_CR5","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.jctb.2013.05.001","volume":"103","author":"G Brinkmann","year":"2013","unstructured":"Brinkmann, G., Goedgebeur, J., H\u00e4gglund, J., Markstr\u00f6m, K.: Generation and Properties of Snarks. J. Combin. Theory Ser. B 103(4), 468\u2013488 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"key":"191_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with (0,1)-vertices. J. Res. Nat. Bur. Standards Sect. B 69, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"issue":"6","key":"191_CR7","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1007\/s00493-016-3379-9","volume":"37","author":"G Fan","year":"2017","unstructured":"Fan, G.: Integer 4-flows and cycle covers. Combinatorica 37(6), 1097\u20131112 (2017)","journal-title":"Combinatorica"},{"issue":"1","key":"191_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jctb.1994.1039","volume":"61","author":"G Fan","year":"1994","unstructured":"Fan, G., Raspaud, A.: Fulkerson\u2019s conjecture and circuit covers. J. Combin. Theory Ser. B 61(1), 133\u2013138 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"191_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01387754","volume":"81","author":"H Fleischner","year":"1976","unstructured":"Fleischner, H.: Eine gemeinsame Basis f\u00fcr die Theorie der Eulerschen Graphen und den Satz von Petersen. Monatsh. Math. 81(4), 267\u2013278 (1976)","journal-title":"Monatsh. Math."},{"key":"191_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0095-8956(79)90057-1","volume":"26","author":"F Jaeger","year":"1979","unstructured":"Jaeger, F.: Flows and generalized coloring theorems in graphs. J. Combin. Theory Ser. B 26, 205\u2013216 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"191_CR11","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/0095-8956(87)90011-6","volume":"43","author":"U Jamshy","year":"1987","unstructured":"Jamshy, U., Raspaud, A., Tarsi, M.: Short circuit covers for regular matroids with a nowhere zero 5 -flow. J. Combin. Theory Ser. B 43(3), 354\u2013357 (1987)","journal-title":"J. Combin. Theory Ser. B"},{"key":"191_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0095-8956(92)90018-S","volume":"56","author":"U Jamshy","year":"1992","unstructured":"Jamshy, U., Tarsi, M.: Short cycle covers and the cycle double cover conjecture. J. Combin. Theory Ser. B 56, 197\u2013204 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"191_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1137\/080717468","volume":"24","author":"T Kaiser","year":"2010","unstructured":"Kaiser, T., Kr\u00e1l\u2019, D., Lidick\u00fd, B., Nejedl\u00fd, P., \u0160\u00e1mal, R.: Short cycle covers of graphs with minimum degree three. SIAM J. Discrete Math. 24(1), 330\u2013355 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"191_CR14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.jctb.2009.12.001","volume":"100","author":"M Kochol","year":"2010","unstructured":"Kochol, M.: Smallest counterexample to the 5-flow conjecture has girth at least eleven. J. Combin. Theory Ser. B. 100(4), 381\u2013389 (2010)","journal-title":"J. Combin. Theory Ser. B."},{"issue":"4.31","key":"191_CR15","first-page":"7","volume":"27","author":"A Kompi\u0161ov\u00e1","year":"2020","unstructured":"Kompi\u0161ov\u00e1, A., Lukot\u2019ka, R.: Short cycle covers of graphs with at most 77% vertices of degree two. Electron. J. Combin. 27(4.31), 7 (2020)","journal-title":"Electron. J. Combin."},{"key":"191_CR16","first-page":"341","volume-title":"Graph Theory and Related Topics (J","author":"PD Seymour","year":"1979","unstructured":"Seymour, P.D.: Sums of circuits. In: Bondy, A., Murty, U.S.R. (eds.) Graph Theory and Related Topics (J, pp. 341\u2013355. Academic Press, New York (1979)"},{"key":"191_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s00373-024-02872-8","volume":"1","author":"D Song","year":"2025","unstructured":"Song, D., Li, S., Wang, X.: On Fan\u2019s conjecture about $$4$$-flow. Graphs Combin. 1, 7 (2025)","journal-title":"Graphs Combin."},{"key":"191_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0004972700042660","volume":"8","author":"G Szekeres","year":"1973","unstructured":"Szekeres, G.: Polyhedral decompositions of cubic graphs. Bull. Austral. Math. Soc. 8, 367\u2013387 (1973)","journal-title":"Bull. Austral. Math. Soc."},{"key":"191_CR19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.4153\/CJM-1954-010-9","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A contribution on the theory of chromatic polynomials. Canad. J. Math. 6, 80\u201391 (1954)","journal-title":"Canad. J. Math."},{"issue":"9","key":"191_CR20","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1007\/s10114-022-1006-9","volume":"38","author":"X Wang","year":"2022","unstructured":"Wang, X., Lu, Y., Zhang, S.-G.: Note on integer 4-flows in graphs. Acta Math. Sin. (Engl. Ser.) 38(9), 1653\u20131664 (2022)","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"191_CR21","volume-title":"Integer flows and cycle covers of graphs","author":"C-Q Zhang","year":"1997","unstructured":"Zhang, C.-Q.: Integer flows and cycle covers of graphs. Marcel Dekker Inc, New York (1997)"},{"key":"191_CR22","unstructured":"Zhang, C.-Q.: Circuit double cover of graphs. London Mathematical Society Lecture Note Series 399, Cambridge University Press, Cambridge (2012)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00191-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-025-00191-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00191-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T13:17:59Z","timestamp":1767014279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-025-00191-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["191"],"URL":"https:\/\/doi.org\/10.1007\/s00493-025-00191-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"12 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"66"}}