{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:28Z","timestamp":1740122368515,"version":"3.37.3"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T00:00:00Z","timestamp":1466121600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T00:00:00Z","timestamp":1466121600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1264800"],"award-info":[{"award-number":["DMS-1264800"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Security agency","award":["H98230-12-1-0233"],"award-info":[{"award-number":["H98230-12-1-0233"]}]},{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-14-1-0154"],"award-info":[{"award-number":["H98230-14-1-0154"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10878-016-0038-4","type":"journal-article","created":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T18:55:42Z","timestamp":1466189742000},"page":"1343-1353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Even factors of graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Jian","family":"Cheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5583-4481","authenticated-orcid":false,"given":"Cun-Quan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Bao-Xuan","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,17]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.jctb.2016.03.002","volume":"119","author":"F Chen","year":"2016","unstructured":"Chen F, Fan G (2016) Maximum even factors of graphs. J Comb Theory Ser B 119:237\u2013244","journal-title":"J Comb Theory Ser B"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Maximum matching and a polyhedron with 0, 1-vertices. J Res Natl Bur Stand Sect B 69:125\u2013130","journal-title":"J Res Natl Bur Stand Sect B"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1002\/jgt.21773","volume":"77","author":"O Favaron","year":"2014","unstructured":"Favaron O, Kouider M (2014) Even factors of large size. J Gr Theory 77:58\u201367","journal-title":"J Gr Theory"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01387754","volume":"81","author":"H Fleischner","year":"1976","unstructured":"Fleischner H (1976) Eine gemeinsame Basis f\u00fcr die Theorie der eulerschen Graphen und den Satz von Petersen. Monatsh Math 81:267\u2013278","journal-title":"Monatsh Math"},{"key":"38_CR5","first-page":"3","volume":"101","author":"H Fleischner","year":"1992","unstructured":"Fleischner H (1992) Spanning Eulerian subgraph, the splitting lemma and Petersen\u2019s theorem. Discrete Math 101:3\u201337","journal-title":"Discrete Math"},{"key":"38_CR6","volume-title":"Even subgraphs of a graph, combinatorics, graph theory and algorithms","author":"H-J Lai","year":"1999","unstructured":"Lai H-J, Chen Z-H (1999) Even subgraphs of a graph, combinatorics, graph theory and algorithms. New Issues Press, Kalamazoo"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen J (1891) Die Theorie der regul\u00e4ren graphs. Acta Math 15:193\u2013220","journal-title":"Acta Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0038-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0038-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0038-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0038-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T12:47:50Z","timestamp":1589719670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0038-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,17]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["38"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0038-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,6,17]]},"assertion":[{"value":"17 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}