{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:03Z","timestamp":1725515283207},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727910"},{"type":"electronic","value":"9783540727927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_4","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"43-52","source":"Crossref","is-referenced-by-count":1,"title":["Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"David","family":"Hartvigsen","sequence":"first","affiliation":[]},{"given":"Yanjun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"258","volume":"247","author":"C. Berge","year":"1958","unstructured":"Berge, C.: Sur le couplate maximum d\u2019un graphe. Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie Sciences [Paris]\u00a0247, 258\u2013259 (1958)","journal-title":"Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie Sciences [Paris]"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S089548019427144X","volume":"10","author":"E. Bertram","year":"1997","unstructured":"Bertram, E., Horak, P.: Decomposing 4-regular graphs into triangle-free 2-factors. SIAM J. Disc. Math.\u00a010, 309\u2013317 (1997)","journal-title":"SIAM J. Disc. Math."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/moor.16.2.259","volume":"16","author":"S.C. Boyd","year":"1991","unstructured":"Boyd, S.C., Cunningham, W.: Small travelling salesman polytopes. Math. Oper. Res.\u00a016, 259\u2013271 (1991)","journal-title":"Math. Oper. Res."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01580109","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and weakly hamiltonian graphs. Math. Prog.\u00a05, 29\u201340 (1973)","journal-title":"Math. Prog."},{"key":"4_CR5","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. John Wiley & Sons, New York (1998)"},{"key":"4_CR6","first-page":"383","volume":"32","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Naddef, D., Pulleyblank, W.R.: The traveling salesman problem in graphs with 3-edge cutsets. J.A.C.M.\u00a032, 383\u2013410 (1985)","journal-title":"J.A.C.M."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(80)90002-3","volume":"29","author":"G. Cornu\u00e9jols","year":"1980","unstructured":"Cornu\u00e9jols, G., Pulleyblank, W.R.: A matching problem with side constraints. Disc. Math.\u00a029, 135\u2013159 (1980)","journal-title":"Disc. Math."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s101079900110","volume":"87","author":"W.H. Cunningham","year":"2000","unstructured":"Cunningham, W.H., Wang, Y.: Restricted 2-factor polytopes. Math. Prog.\u00a087, 87\u2013111 (2000)","journal-title":"Math. Prog."},{"key":"4_CR9","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.\u00a017, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"key":"4_CR10","doi-asserted-by":"crossref","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. of Res. National Bur. of Standards\u00a069, 125\u2013130 (1965)","journal-title":"J. of Res. National Bur. of Standards"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1287\/opre.27.4.799","volume":"27","author":"M.L. Fisher","year":"1979","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for finding a maximum weight Hamiltonian circuit. Oper. Res.\u00a027, 799\u2013809 (1979)","journal-title":"Oper. Res."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1145\/800061.808776","volume-title":"Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing","author":"H.N. Gabow","year":"1983","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bideredted network flow problems. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 448\u2013456. The Association for Computing Machinery, New York (1983)"},{"key":"4_CR13","first-page":"282","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel, M., Padberg, M.W.: On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Prog.\u00a016, 282\u2013302 (1979)","journal-title":"Math. Prog."},{"key":"4_CR14","unstructured":"Hartvigsen, D.: Extensions of Matching Theory. Ph.D. Thesis (under the supervision of Cornu\u00e9jols, G.), Carnegie-Mellon University (1984)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.jctb.2006.01.004","volume":"96","author":"D. Hartvigsen","year":"2006","unstructured":"Hartvigsen, D.: Finding maximum square-free 2-matchings in bipartite graphs. J. of Comb. Th. B\u00a096, 693\u2013705 (2006)","journal-title":"J. of Comb. Th. B"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0401046","volume":"1","author":"P. Hell","year":"1988","unstructured":"Hell, P., Kirkpatrick, D., Kratochv\u00edl, J., K\u0155\u00ed\u017a, I.: On restricted 2-factors. SIAM J. Disc. Math\u00a01, 472\u2013484 (1988)","journal-title":"SIAM J. Disc. Math"},{"key":"4_CR17","first-page":"111","volume":"20","author":"D. Holton","year":"1999","unstructured":"Holton, D., Aldred, R.E.L.: Planar graphs, regular graphs, bipartite graphs and Hamiltonicity. Australas. J. Combin.\u00a020, 111\u2013131 (1999)","journal-title":"Australas. J. Combin."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge coloring. SIAM Journal on Computing\u00a010, 718\u2013720 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR19","unstructured":"Johnson, E.: Network Flows, Graphs and Integer Programming. Ph.D. Thesis, University of California, Berkeley (1965)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Kaiser, T., Skrekovski, R.: Cycles intersecting cuts of prescribed sizes. Manuscript (2005)","DOI":"10.46298\/dmtcs.3465"},{"key":"4_CR21","volume-title":"The Traveling Salesman Problem \u2013 A Guided Tour of Combinatorial Optimization","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem \u2013 A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)"},{"key":"4_CR22","unstructured":"Nam, Y.: Matching Theory: Subgraphs with Degree Constraints and other Properties. Ph.D. Thesis (Under the supervision of Anstee, R.), University of British Columbia (1994)"},{"key":"4_CR23","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 Mathematica\u00a015, 193\u2013220 (1891)","journal-title":"Acta Mathematica"},{"key":"4_CR24","first-page":"225","volume":"5","author":"J. Petersen","year":"1898","unstructured":"Petersen, J.: Sur le theoreme de Tait. L\u2019Intermediaire des Mathematiciens\u00a05, 225\u2013227 (1898)","journal-title":"L\u2019Intermediaire des Mathematiciens"},{"key":"4_CR25","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Tait, P.G.: Remarks on the previous communication. Proceedings of the Royal Society of Edinburgh 10, 729 (1878-80)","DOI":"10.1017\/S0370164600044643"},{"key":"4_CR27","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.\u00a022, 107\u2013111 (1947)","journal-title":"J. London Math. Soc."},{"key":"4_CR28","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. Canadian J. of Math.\u00a06, 347\u2013352 (1954)","journal-title":"Canadian J. of Math."},{"key":"4_CR29","unstructured":"Vornberger, O.: Easy and hard cycle covers. Manuscript, Universit\u00e4t Paderborn (1980)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72792-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T14:58:27Z","timestamp":1683903507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_4","relation":{},"subject":[]}}