{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:03:16Z","timestamp":1777442596262,"version":"3.51.4"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T00:00:00Z","timestamp":1266883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10878-010-9299-5","type":"journal-article","created":{"date-parts":[[2010,2,22]],"date-time":"2010-02-22T19:02:17Z","timestamp":1266865337000},"page":"322-330","source":"Crossref","is-referenced-by-count":3,"title":["Tight bound for matching"],"prefix":"10.1007","volume":"23","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,23]]},"reference":[{"issue":"1\u20133","key":"9299_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.disc.2004.05.003","volume":"285","author":"T Biedl","year":"2004","unstructured":"Biedl T, Demaine E, Duncan C, Fleischer R, Kobourov S (2004) Tight bounds on the maximal and maximum matchings. Discrete Math 285(1\u20133):7\u201315","journal-title":"Discrete Math"},{"key":"9299_CR2","unstructured":"Feng W, Qu W, Wang H (2007) Lower bounds on the cardinality of maximum matchings in graphs with bounded degrees. In: Proceedings of the 2007 international conference on foundations of computer science, Las Vegas, pp 110\u2013113"},{"key":"9299_CR3","series-title":"Lecture notes in computer science","first-page":"171","volume-title":"Proceedings of the second international workshop on frontiers in algorithmics (FAW\u20192008)","author":"Y Han","year":"2008","unstructured":"Han Y (2008) Matching for graphs of bounded degree. In: Proceedings of the second international workshop on frontiers in algorithmics (FAW\u20192008), Changsha, China. Lecture notes in computer science, vol 5059. Springer, Berlin, pp 171\u2013173"},{"key":"9299_CR4","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D K\u00f6nig","year":"1916","unstructured":"K\u00f6nig D (1916) \u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math Ann 77:453\u2013456","journal-title":"Math Ann"},{"key":"9299_CR5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","volume":"41","author":"J Misra","year":"1992","unstructured":"Misra J, Gries D (1992) A constructive proof of Vizing\u2019s theorem. Inf Process Lett 41:131\u2013133","journal-title":"Inf Process Lett"},{"issue":"3","key":"9299_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(79)90133-X","volume":"28","author":"T Nishizeki","year":"1979","unstructured":"Nishizeki T, Baybars I (1979) Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math 28(3):255\u2013267","journal-title":"Discrete Math"},{"key":"9299_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen J (1891) Die Theorie der regul\u00e4ren Graphs (The theory of regular graphs). Acta Math 15:193\u2013220","journal-title":"Acta Math"},{"key":"9299_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte WT (1947) The factorization of linear graphs. J Lond Math Soc 22:107\u2013111","journal-title":"J Lond Math Soc"},{"key":"9299_CR9","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of chromatic class of a p-graph. Diskretn Anal 3:25\u201330 (in Russian)","journal-title":"Diskretn Anal"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9299-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9299-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9299-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9299-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,23]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9299"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9299-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,23]]}}}