{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:04:12Z","timestamp":1648955052073},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2007,5]]},"DOI":"10.1007\/s00493-007-2131-x","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T01:17:24Z","timestamp":1211937444000},"page":"383-398","source":"Crossref","is-referenced-by-count":1,"title":["Matchings of cycles and paths in directed graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Gyula","family":"Pap","sequence":"first","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Szeg\u0151","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,29]]},"reference":[{"key":"2131_CR1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0095-8956(86)90085-7","volume":"40","author":"G. Cornu\u00e9jols","year":"1986","unstructured":"G. Cornu\u00e9jols and D. Hartvigsen: An extension of matching theory, Journal of Combinatorial Theory Ser. B 40 (1986), 285\u2013296.","journal-title":"Journal of Combinatorial Theory Ser. B"},{"key":"2131_CR2","doi-asserted-by":"crossref","unstructured":"G. Cornu\u00e9jols, D. Hartvigsen and W. Pulleyblank: Packing subgraphs in a graph, Op. Res. Letters, (1982), 139\u2013143.","DOI":"10.1016\/0167-6377(82)90016-5"},{"key":"2131_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(80)90002-3","volume":"29","author":"G. Cornu\u00e9jols","year":"1980","unstructured":"G. Cornu\u00e9jols and W. Pulleyblank: A matching problem with side conditions, Discrete Mathematics 29 (1980), 135\u2013159.","journal-title":"Discrete Mathematics"},{"issue":"1","key":"2131_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579340","volume":"3","author":"G. Cornu\u00e9jols","year":"1983","unstructured":"G. Cornu\u00e9jols and W. Pulleyblank: Critical graphs, matchings and tours or a hierarchy of the travelling salesman problem, Combinatorica 3(1) (1983), 35\u201352.","journal-title":"Combinatorica"},{"issue":"3","key":"2131_CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070100256","volume":"91","author":"W. H. Cunningham","year":"2002","unstructured":"W. H. Cunningham: Matching, Matroids and Extensions, Math. Program. Ser. B 91(3) (2002), 515\u2013542.","journal-title":"Math. Program. Ser. B"},{"issue":"3","key":"2131_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01215915","volume":"17","author":"W. H. Cunningham","year":"1997","unstructured":"W. H. Cunningham and J. F. Geelen: The Optimal Path-Matching Problem, Combinatorica 17(3) (1997), 315\u2013336.","journal-title":"Combinatorica"},{"key":"2131_CR7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds: Paths, trees, and flowers, Canadian Journal of Mathematics 17 (1965), 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"issue":"2","key":"2131_CR8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1006\/jctb.1993.1023","volume":"57","author":"S. Felsner","year":"1993","unstructured":"S. Felsner: Orthogonal structures in directed graphs, Journal of Combinatorial Theory Ser. B 57(2) (1993), 309\u2013321.","journal-title":"Journal of Combinatorial Theory Ser. B"},{"issue":"2","key":"2131_CR9","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10055","volume":"41","author":"A. Frank","year":"2002","unstructured":"A. Frank and L. Szeg\u0151: A Note on the Path-Matching Formula, J. of Graph Theory 41(2) (2002), 110\u2013119.","journal-title":"J. of Graph Theory"},{"key":"2131_CR10","first-page":"401","volume":"9","author":"T. Gallai","year":"1964","unstructured":"T. Gallai: Maximale Systeme unabh\u00e4ngiger Kanten, A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematika Kutat\u00f3int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei 9 (1964), 401\u2013413.","journal-title":"A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematika Kutat\u00f3int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"key":"2131_CR11","unstructured":"J. Geelen: An algebraic approach to matching problems, manuscript."},{"key":"2131_CR12","doi-asserted-by":"crossref","unstructured":"T. Kir\u00e1ly and M. Makai: On polyhedra related to even factors, Proceedings of 10th International IPCO Conference, D. Bienstock, G. Nemhauser (eds.), Lecture Notes in Computer Science, Springer, 2004, 416\u2013430.","DOI":"10.1007\/978-3-540-25960-2_31"},{"key":"2131_CR13","unstructured":"Z. Kir\u00e1ly and J. Szab\u00f3: Generalized induced factor problems, Egres Technical Report, 2002."},{"key":"2131_CR14","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1006\/jctb.1993.1058","volume":"59","author":"M. Loebl","year":"1993","unstructured":"M. Loebl and S. Poljak: Efficient Subgraph Packing, Journal of Combinatorial Theory Ser. B 59 (1993), 106\u2013121.","journal-title":"Journal of Combinatorial Theory Ser. B"},{"key":"2131_CR15","first-page":"565","volume-title":"Fundamentals of Computational Theory","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz: On determinants, matchings and random algorithms, in Fundamentals of Computational Theory (L. Budach, ed.), Akademie-Verlag, Berlin, 1979, 565\u2013574."},{"key":"2131_CR16","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. D. Plummer: Matching Theory, Akad\u00e9miai Kiad\u00f3, Budapest, 1986."},{"issue":"2","key":"2131_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.jctb.2004.01.001","volume":"91","author":"Gy. Pap","year":"2004","unstructured":"Gy. Pap and L. Szeg\u0151: On the Maximum Even Factor in Weakly Symmetric Graphs, Journal of Combinatorial Theory Ser. B 91(2) (2004), 201\u2013213.","journal-title":"Journal of Combinatorial Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2131-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-007-2131-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2131-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:45Z","timestamp":1559079165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-007-2131-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["2131"],"URL":"https:\/\/doi.org\/10.1007\/s00493-007-2131-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5]]}}}