{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:44Z","timestamp":1740109304326,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T00:00:00Z","timestamp":1653955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T00:00:00Z","timestamp":1653955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100012952","name":"Universit\u00e9 Grenoble Alpes","doi-asserted-by":"publisher","award":["IDEX-IRS SACRE"],"award-info":[{"award-number":["IDEX-IRS SACRE"]}],"id":[{"id":"10.13039\/100012952","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003032","name":"Association Nationale de la Recherche et de la Technologie","doi-asserted-by":"crossref","award":["CIFRE 2015\/0553"],"award-info":[{"award-number":["CIFRE 2015\/0553"]}],"id":[{"id":"10.13039\/501100003032","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Development Agency of Hungary","award":["K 109240"],"award-info":[{"award-number":["K 109240"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10107-022-01804-9","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T12:02:41Z","timestamp":1653998561000},"page":"271-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How many matchings cover the nodes of a graph?"],"prefix":"10.1007","volume":"203","author":[{"given":"Dehia Ait","family":"Ferhat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9815-5793","authenticated-orcid":false,"given":"Zolt\u00e1n","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Seb\u0151","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2809-8447","authenticated-orcid":false,"given":"Gautier","family":"Stauffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,31]]},"reference":[{"issue":"1","key":"1804_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S1385-7258(78)80007-9","volume":"81","author":"C Berge","year":"1978","unstructured":"Berge, C., Las Vergnas, M.: On the existence of subgraphs with degree constraints. Indag. Math. 81(1), 165\u2013176 (1978)","journal-title":"Indag. Math."},{"key":"1804_CR2","unstructured":"Edmonds, J., Johnson, E.L.: Matching: a well-solved class of integer linear programs. In: Guy, H., Sauer, S. (eds.) Combinatorial Structures and their Applications, pp. 89\u201392 (1970)"},{"issue":"125\u2013130","key":"1804_CR3","first-page":"55","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Natl. Bureau Stand. B 69(125\u2013130), 55\u201356 (1965)","journal-title":"J. Res. Natl. Bureau Stand. B"},{"key":"1804_CR4","unstructured":"Fournier, J.C.: Coloration des aretes d\u2019un graphe. Cah. Centre Etudes Rech. Oper. 15, 311\u2013314 (1973)"},{"key":"1804_CR5","doi-asserted-by":"crossref","unstructured":"Gerards, A.: Matching. In: Handbooks of Operations Research and Management Science, Chapter 3, vol. 7, pp. 135\u2013223 (1995)","DOI":"10.1016\/S0927-0507(05)80120-3"},{"key":"1804_CR6","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 J. Comput. 10, 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"1804_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0012-365X(90)90387-W","volume":"85","author":"K Heinrich","year":"1990","unstructured":"Heinrich, K., Hell, P., Kirkpatrick, D.G., Liu, G.: A simple existence criterion for $$(g <f)$$-factors. Discrete Math. 85, 313\u2013317 (1990)","journal-title":"Discrete Math."},{"key":"1804_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0012-365X(84)90150-X","volume":"49","author":"P Hell","year":"1984","unstructured":"Hell, P., Kirkpatrick, D.G.: Packings by cliques and by finite families of graphs. Discrete Math. 49, 45\u201359 (1984)","journal-title":"Discrete Math."},{"key":"1804_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/0607024","volume":"7","author":"P Hell","year":"1986","unstructured":"Hell, P., Kirkpatrick, D.G.: Packings by complete bipartite graphs. SIAM J. Algebr. Discrete Methods 7, 199\u2013209 (1986)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"1804_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1006\/jagm.1993.1006","volume":"14","author":"P Hell","year":"1993","unstructured":"Hell, P., Kirkpatrick, D.G.: Algorithm for degree constrained graph factors of minimum deficiency. J. Algor. 14, 115\u2013138 (1993)","journal-title":"J. Algor."},{"key":"1804_CR11","first-page":"453","volume":"34","author":"D K\u0151nig","year":"1916","unstructured":"K\u0151nig, D.: Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s a halmazok elm\u00e9let\u00e9re [in Hungarian]. Mat. Term. \u00c9rt. 34, 453\u2013465 (1916)","journal-title":"Mat. Term. \u00c9rt."},{"key":"1804_CR12","doi-asserted-by":"crossref","unstructured":"K\u0151nig, D.: \u00dcber Graphen und ihre anwendung auf determinantentheorie und mengenlehre. Math. Ann. 77(4), 453\u2013465 (1916) (English translation by \u00c1gnes Cseh, https:\/\/econ.core.hu\/file\/download\/Konig1916.pdf)","DOI":"10.1007\/BF01456961"},{"key":"1804_CR13","volume-title":"Matching theory. North-Holland Mathematics Studies","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. North-Holland Mathematics Studies. North-Holland, Amsterdam, New York (1986)"},{"key":"1804_CR14","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin, Heidelberg (2003)"},{"key":"1804_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."},{"key":"1804_CR16","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1090\/S0002-9939-1953-0063009-7","volume":"4","author":"WT Tutte","year":"1953","unstructured":"Tutte, W.T.: The $$1$$-factors of oriented graphs. Proc. Am. Math. Soc. 4, 922\u2013931 (1953)","journal-title":"Proc. Am. Math. Soc."},{"key":"1804_CR17","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor theorem for finite graphs. Can. J. Math. 6, 347\u2013352 (1954)","journal-title":"Can. J. Math."},{"key":"1804_CR18","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a $$p$$-graph, [in Russian]. Diskret. Analiz. 3, 25\u201330 (1964)","journal-title":"Diskret. Analiz."},{"issue":"1","key":"1804_CR19","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10107-013-0731-3","volume":"147","author":"X Wang","year":"2014","unstructured":"Wang, X., Song, X., Yuan, Y.: On matching cover of graphs. Math. Progr. 147(1), 499\u2013518 (2014)","journal-title":"Math. Progr."},{"key":"1804_CR20","unstructured":"Wang, X., Song, X., Yuan, Y.: A note on Matching Cover Algorithm. arXiv:1612.00943 (2016)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01804-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01804-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01804-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T18:06:43Z","timestamp":1707502003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01804-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,31]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1804"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01804-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2022,5,31]]},"assertion":[{"value":"4 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}