{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:55Z","timestamp":1740107095581,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T00:00:00Z","timestamp":1598486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T00:00:00Z","timestamp":1598486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971110","11671087"],"award-info":[{"award-number":["11971110","11671087"]}],"id":[{"id":"10.13039\/501100001809","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":[[2020,9]]},"DOI":"10.1007\/s00373-020-02224-2","type":"journal-article","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T07:03:54Z","timestamp":1598511834000},"page":"1423-1443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Signed Circuit Cover of Bridgeless Signed Graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Mengmeng","family":"Xie","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6156-9570","authenticated-orcid":false,"given":"Chuixiang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"2224_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. Algeb. Discrete Methods 6, 345\u201350 (1985)","journal-title":"SIAM J. Algeb. Discrete Methods"},{"key":"2224_CR2","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"},{"issue":"3","key":"2224_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0095-8956(83)90041-2","volume":"34","author":"A Bouchet","year":"1983","unstructured":"Bouchet, A.: Nowhere-zero integral flows on a bidirected graph. J. Combin. Theory Ser. B 34(3), 279\u2013292 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2224_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2017.10.002","volume":"235","author":"J Chen","year":"2018","unstructured":"Chen, J., Fan, G.: Short signed circuit cover of signed graphs. Discrete Appl. Math. 235, 51\u201358 (2018)","journal-title":"Discrete Appl. Math."},{"key":"2224_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jctb.2018.06.001","volume":"134","author":"J Cheng","year":"2019","unstructured":"Cheng, J., Lu, Y., Luo, R., Zhang, C.-Q.: Shortest circuit cover of signed graphs. J. Combin. Theory Ser. B 134, 164\u2013178 (2019)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2224_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1006\/jctb.1998.1854","volume":"74","author":"G Fan","year":"1998","unstructured":"Fan, G.: Proofs of two minimum circuit covers conjectures. J. Combin. Theory Ser. B 74, 353\u2013367 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2224_CR7","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"},{"key":"2224_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-08860-1_21","volume-title":"Covering a graph by circuits, automata, languages, and programming","author":"A Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Covering a graph by circuits, automata, languages, and programming. Lecture notes in computer science, vol. 62, pp. 289\u2013299. Springer, Berlin (1978)"},{"key":"2224_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.22439","volume":"92","author":"T Kaiser","year":"2019","unstructured":"Kaiser, T., Lukot\u2019ka, R., M\u00e1\u010dajov\u00e1, E., Rollov\u01ce, E.: Shorter signed circuit covers of graphs. J. Graph Theory 92, 39\u201356 (2019)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2224_CR10","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\u01ce, E., \u0160koviera, M.: Circuit covers of signed graphs. J. Graph Theory 81(2), 120\u2013133 (2016)","journal-title":"J. Graph Theory"},{"key":"2224_CR11","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1137\/17M1150098","volume":"33","author":"E M\u00e1\u010dajov\u00e1","year":"2019","unstructured":"M\u00e1\u010dajov\u00e1, E., Rollov\u01ce, E., \u0160koviera, M.: Circuit covers of signed Eulerian graphs. SIAM J. Discrete Math. 33, 933\u2013957 (2019)","journal-title":"SIAM J. Discrete Math."},{"key":"2224_CR12","first-page":"341","volume-title":"Graph theory and related topics","author":"PD Seymour","year":"1979","unstructured":"Seymour, P.D.: Sums of circuits. In: Bondy, J.A., Murty, U.S.R. (eds.) Graph theory and related topics, pp. 341\u2013355. Academic Press, New York (1979)"},{"key":"2224_CR13","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. Aust. Math. Soc. 8, 367\u2013387 (1973)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"1","key":"2224_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1002\/jgt.22238","volume":"89","author":"Y Wu","year":"2018","unstructured":"Wu, Y., Ye, D.: Circuit covers of cubic signed graphs. J. Graph Theory 89(1), 40\u201354 (2018)","journal-title":"J. Graph Theory"},{"key":"2224_CR15","unstructured":"Wu, Y., Ye, D.: Minimum T-joins and signed-circuit covering. arXiv:1803.03696"},{"key":"2224_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graphs. Discrete Appl. Math. 4, 47\u201374 (1982)","journal-title":"Discrete Appl. Math."},{"key":"2224_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511863158","volume-title":"Circuit double cover of graphs","author":"C-Q Zhang","year":"2012","unstructured":"Zhang, C.-Q.: Circuit double cover of graphs. Cambridge University Press, London (2012)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02224-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02224-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02224-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T23:55:05Z","timestamp":1630022105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02224-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,27]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["2224"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02224-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,8,27]]},"assertion":[{"value":"4 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}