{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:37:24Z","timestamp":1725514644432},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693109"},{"type":"electronic","value":"9783540693116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69311-6_19","type":"book-chapter","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T11:17:46Z","timestamp":1212751066000},"page":"171-173","source":"Crossref","is-referenced-by-count":3,"title":["Matching for Graphs of Bounded Degree"],"prefix":"10.1007","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"19_CR1","doi-asserted-by":"publisher","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.: Tight bounds on the maximal and maximum matchings. Discrete Math.\u00a0285(1-3), 7\u201315 (2004)","journal-title":"Discrete Math."},{"key":"19_CR2","unstructured":"Feng, W., Qu, W., Wang, H.: Lower bounds on the cardinality of maximum matchings in graphs with bounded degrees. In: Proc. 2007 Int. Conf. on Foundations of Computer Science, Las Vegas, pp. 110\u2013113 (2007)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann.\u00a077, 453\u2013456 (1916)","journal-title":"Math. Ann."},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(79)90133-X","volume":"28","author":"T. Nishizeki","year":"1979","unstructured":"Nishizeki, T., Baybars, I.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math.\u00a028(3), 255\u2013267 (1979)","journal-title":"Discrete Math."},{"key":"19_CR5","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 (The theory of regular graphs). Acta Math.\u00a015, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"19_CR6","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."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69311-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:34:50Z","timestamp":1620016490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69311-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540693109","9783540693116"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69311-6_19","relation":{},"subject":[]}}