{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T15:07:42Z","timestamp":1726758462689},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660194"},{"type":"electronic","value":"9783540487777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_18","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T08:43:11Z","timestamp":1172824991000},"page":"234-241","source":"Crossref","is-referenced-by-count":15,"title":["The Square-Free 2-Factor Problem in Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Hartvigsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge, C., Two theorems in graph theory. Proceedings of the National Academy of Sciences (U.S.A.) 43 (1957) 842\u2013844.","journal-title":"Proceedings of the National Academy of Sciences (U.S.A.)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(80)90002-3","volume":"29","author":"G. Cornuejols","year":"1980","unstructured":"Cornuejols, G. and W.R. Pulleyblank. A matching problem with side conditions. Disc. Math. 29 (1980) 135\u2013159.","journal-title":"Disc. Math."},{"key":"18_CR3","unstructured":"Cunningham, W.H. and J. Geelen. Personal communication (1997)."},{"key":"18_CR4","unstructured":"Cunningham, W.H. and Y. Wang. Restricted 2-factor polytopes. Working paper, Dept. of Comb. and Opt., University of Waterloo (Feb. 1997)."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.6028\/jres.069B.005","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 (1965) 73\u201377.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J., Paths, trees, and flowers. Canad. J. Math. 17 (1965) 449\u2013467.","journal-title":"Canad. J. Math."},{"key":"18_CR7","unstructured":"Hartvigsen, D. Extensions of Matching Theory. Ph.D. Thesis, Carnegie-Mellon University (1984)."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-642-68874-4_18","volume-title":"Mathematical Programming, the State of the Art: Bonn, 1982","author":"A. Schrijver","year":"1983","unstructured":"Schrijver, A., Min-max results in combinatorial optimization. in Mathematical Programming, the State of the Art: Bonn, 1982, Eds.: A. Bachem, M. Grotschel, and B. Korte, Springer-Verlag, Berlin (1983) 439\u2013500."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W.T. Tutte","year":"1947","unstructured":"Tutte, W.T., The factorization of linear graphs. J. London Math. Soc. 22 (1947) 107\u2013111.","journal-title":"J. London Math. Soc."},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W.T. Tutte","year":"1952","unstructured":"Tutte, W.T., The factors of graphs. Canad. J. Math. 4 (1952) 314\u2013328.","journal-title":"Canad. J. Math."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"W.T. Tutte","year":"1954","unstructured":"Tutte, W.T., A short proof of the factor theorem for finite graphs. Canad. J. Math. 6 (1954) 347\u2013352.","journal-title":"Canad. J. Math."},{"key":"18_CR12","unstructured":"Vornberger, O., Easy and hard cycle covers. Preprint, Universitat Paderborn (1980)."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48777-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T22:09:47Z","timestamp":1550268587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}