{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T04:10:57Z","timestamp":1649218257489},"reference-count":14,"publisher":"Informa UK Limited","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1080\/00207160802562523","type":"journal-article","created":{"date-parts":[[2009,7,24]],"date-time":"2009-07-24T19:42:35Z","timestamp":1248464555000},"page":"1680-1691","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for (0, 1,<i>d<\/i>)-graphs with<i>d<\/i>constrains"],"prefix":"10.1080","volume":"87","author":[{"given":"Yueping","family":"Li","sequence":"first","affiliation":[]},{"given":"Dingjun","family":"Lou","sequence":"additional","affiliation":[]},{"given":"Yunting","family":"Lu","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00827-0"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1145\/1103963.1103969"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798347189"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.015"},{"key":"CIT0005","unstructured":"Li, Y. and Lou, D. A new algorithm for determinating 1-extendable graphs: design and implementation. Proceedings of International Multiconference of Engineers and Computer Scientists. March21\u201323, Hong Kong, China. pp.2327\u20132332. Hong Kong: Newswood Limited."},{"key":"CIT0006","unstructured":"Li, Y. and Lou, D. Matching extendability augmentation in bipartite graphs. Proceedings of International Multiconference of Engineers and Computer Scientists. March21\u201323, Hong Kong, China. pp.2291\u20132296. Hong Kong: Newswood Limited."},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"Li, Y. and Lou, D. Finding the (n, k, 0)-extendability in bipartite graphs and its application. Proceedings of International Conference on Computational Science. May27\u2013312007, Beijing, China. pp.401\u2013409. Lect. Notes Comput. Sci. 4489","DOI":"10.1007\/978-3-540-72588-6_66"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00328-9"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.10.019"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90037-0"},{"key":"CIT0011","first-page":"3","volume":"116","author":"Plummer M.","year":"1996","journal-title":"Congr. Numer"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)00485-A"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.09.036"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.025"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160802562523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T17:40:12Z","timestamp":1558460412000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160802562523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":14,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["10.1080\/00207160802562523"],"URL":"https:\/\/doi.org\/10.1080\/00207160802562523","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}