{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T11:09:13Z","timestamp":1693048153231},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,2,1]],"date-time":"2007-02-01T00:00:00Z","timestamp":1170288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,2]]},"DOI":"10.1007\/s00373-006-0686-8","type":"journal-article","created":{"date-parts":[[2007,2,22]],"date-time":"2007-02-22T17:15:01Z","timestamp":1172164501000},"page":"47-60","source":"Crossref","is-referenced-by-count":4,"title":["Bicolored Matchings in Some Classes of Graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"M. C.","family":"Costa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. de","family":"Werra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Picouleau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Ries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"686_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.: Network flows. Prentice-Hall, 1993"},{"key":"686_CR2","doi-asserted-by":"crossref","unstructured":"Asratian, A.S., Denley, T.M.J., H\u00e4ggkvist, R.: Bipartite graphs and their applications. Cambridge University Press, Cambridge, 1998","DOI":"10.1017\/CBO9780511984068"},{"key":"686_CR3","unstructured":"Berge, C.: Graphes. Gauthier-Villars, Paris, 1983"},{"key":"686_CR4","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, R., Kaboadi, S.N., Murty, K.G.: Some NP-complete problems in linear programming. Operations Research Letters, 1, 101\u2013104 (1982)","DOI":"10.1016\/0167-6377(82)90006-2"},{"key":"686_CR5","doi-asserted-by":"crossref","unstructured":"de Werra, D.: On line-perfect graphs. Mathematical programming, 15, 236\u2013238 (1978)","DOI":"10.1007\/BF01609025"},{"key":"686_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U., Okek, E., Wieder, U.: Approximating maximum edge coloring in multigraphs. Technical Report, Weizmann Institute, 2003","DOI":"10.1007\/3-540-45753-4_11"},{"key":"686_CR7","doi-asserted-by":"crossref","unstructured":"Gabor, H.N., Tarjan, R.E.: Efficient algorithms for a family of matroid intersection problems. Journal of Algorithms, 5, 80\u2013131 (1984)","DOI":"10.1016\/0196-6774(84)90042-7"},{"key":"686_CR8","doi-asserted-by":"crossref","unstructured":"Gross, J.L., Yell, J.: Handbook of graph theory. CRC Press, London, 2004","DOI":"10.1201\/9780203490204"},{"key":"686_CR9","unstructured":"Hartvigsen D.: Extensions of matching theory (Ph.D. thesis). Carnegie\u2013Mellon University, 1984"},{"key":"686_CR10","doi-asserted-by":"crossref","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM Journal on Computing, 10, 718\u2013720 (1981)","DOI":"10.1137\/0210055"},{"key":"686_CR11","unstructured":"Karzanov A.V.: Maximum matching of given weight in complete and complete bipartite graphs. Kibernetika, 1:7\u201311, 1987. English translation in CYBNAW 23, 8\u201313"},{"key":"686_CR12","unstructured":"Lovasz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, 29, 1986"},{"key":"686_CR13","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, New York, 1979"},{"key":"686_CR14","unstructured":"Trotter, L.E.: Line-perfect graphs. Mathematical Programming, 12, 255\u2013259, (1977)"},{"key":"686_CR15","doi-asserted-by":"crossref","unstructured":"Yi, T., Murty, K.G., Spera, C.: Matchings in colored bipartite networks. Discrete Applied Mathematics, 121, 261\u2013277 (2002)","DOI":"10.1016\/S0166-218X(01)00300-6"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0686-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0686-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0686-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T05:49:15Z","timestamp":1587361755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0686-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2]]}},"alternative-id":["686"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0686-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2]]}}}