{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:43Z","timestamp":1740107143707,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["126480"],"award-info":[{"award-number":["126480"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-16-1-0004"],"award-info":[{"award-number":["H98230-16-1-0004"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00373-018-1881-0","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T08:41:47Z","timestamp":1519375307000},"page":"365-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Liying","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weihua","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yezhou","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cun-Quan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"key":"1881_CR1","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"},{"issue":"3","key":"1881_CR2","first-page":"3","volume":"24","author":"MA Bahmanian","year":"2017","unstructured":"Bahmanian, M.A., \u0160ajna, M.: Quasi-Eulerian Hypergraphs. Electron. J. Comb. 24(3), 3\u201330 (2017)","journal-title":"Electron. J. Comb."},{"key":"1881_CR3","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam, London (1973)"},{"key":"1881_CR4","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 covering of graphs with cycles. J. Combin. Theory Ser. B 35, 297\u2013308 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1881_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/jgt.3190090107","volume":"9","author":"B Bollobas","year":"1985","unstructured":"Bollobas, B., Saito, A., Wormald, N.C.: Regular factors of regular graphs. J. Graph Theory 9, 97\u2013103 (1985)","journal-title":"J. Graph Theory"},{"key":"1881_CR6","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, New York (2008)"},{"key":"1881_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0095-8956(92)90069-A","volume":"54","author":"G-H Fan","year":"1992","unstructured":"Fan, G.-H.: Integer flows and cycle covers. J. Combin. Theory Ser. B 54, 113\u2013122 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1881_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1137\/0405039","volume":"5","author":"G-H Fan","year":"1992","unstructured":"Fan, G.-H.: Covering graphs by cycles. SIAM J. Discrete Math. 5, 491\u2013496 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"1881_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/jgt.3190180204","volume":"18","author":"G-H Fan","year":"1994","unstructured":"Fan, G.-H.: Short cycle covers of cubic graphs. J. Graph Theory 18, 131\u2013141 (1994)","journal-title":"J. Graph Theory"},{"key":"1881_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jctb.1994.1039","volume":"61","author":"G-H Fan","year":"1994","unstructured":"Fan, G.-H., Raspaud, A.: Fulkerson\u2019s conjecture and circuits covers. J. Combin. Theory Ser. B 61, 133\u2013138 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1881_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1006\/jctb.1998.1854","volume":"74","author":"G-H Fan","year":"1998","unstructured":"Fan, G.-H.: Proofs of two minimum circuit cover conjectures. J. Combin. Theory Ser. B 74, 353\u2013367 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1881_CR12","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, 267\u2013278 (1976)","journal-title":"Monatsh. Math."},{"key":"1881_CR13","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Covering a graph by circuits. In: \u201cAutomata, Languages and Programming,\u201d Lecture Notes in Computer Science, Vol. 62, pp. 289-299. Springer, Berlin (1978)","DOI":"10.1007\/3-540-08860-1_21"},{"key":"1881_CR14","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"},{"key":"1881_CR15","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 nowhere-zero $$5$$-flow. J. Combin. Theory Ser. B 43, 354\u2013357 (1987)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"R144","key":"1881_CR16","first-page":"1","volume":"17","author":"Z Lonc","year":"2010","unstructured":"Lonc, Z., Naroski, P.: On tours that contain all edges of a hypergraph. Electron. J. Comb. 17(R144), 1 (2010)","journal-title":"Electron. J. Comb."},{"key":"1881_CR17","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1002\/jgt.20563","volume":"68","author":"E M\u00e1\u010dajov\u00e1","year":"2011","unstructured":"M\u00e1\u010dajov\u00e1, E., Raspaud, A., Tarsi, M., Zhu, X.-D.: Short cycle covers of graphs and nowhere-zero flows. J. Graph Theory 68, 340\u2013348 (2011)","journal-title":"J. Graph Theory"},{"key":"1881_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1002\/jgt.21866","volume":"81","author":"E M\u00e1\u010dajov\u00e1","year":"2016","unstructured":"M\u00e1\u010dajov\u00e1, E., Raspaud, A., Rollov\u00e1, E., \u0160koviera, M.: Circuit covers of signed graphs. J. Graph Theory 81, 120\u2013133 (2016)","journal-title":"J. Graph Theory"},{"key":"1881_CR19","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren Graphs. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"1881_CR20","unstructured":"Sajna, M.: Eulerian-type properties of hypregraphs (slides) presented at Contributed Minisymposia \u201cHypergraphs(CM22)\u201d. CanaDAM 2013\u2014Canadian Mathematical Society (2013)"},{"key":"1881_CR21","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1112\/plms\/s3-38.3.423","volume":"s3\u201338","author":"PD Seymour","year":"1979","unstructured":"Seymour, P.D.: On multi-colorings of cubic graphs and the conjecture of Fulkerson and Tutte. Proc. Lond. Math. Soc. s3\u201338, 423\u2013460 (1979)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1881_CR22","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. Austr. Math. Soc. 8, 367\u2013387 (1973)","journal-title":"Bull. Austr. Math. Soc."},{"key":"1881_CR23","unstructured":"Tutte, W.T.: Personal correspondence with H. Fleischner (July 22nd, 1987)"},{"key":"1881_CR24","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"},{"key":"1881_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/jgt.10040","volume":"40","author":"C-Q Zhang","year":"2002","unstructured":"Zhang, C.-Q.: Circular flows of nearly eulerian graphs and vertex splitting. J. Graph Theory 40, 147\u2013161 (2002)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1881-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1881-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1881-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:55:36Z","timestamp":1589446536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1881-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1881"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1881-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"5 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}