{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T07:52:57Z","timestamp":1769154777629,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00125-2","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"277-281","source":"Crossref","is-referenced-by-count":9,"title":["Maximum induced matchings in graphs"],"prefix":"10.1016","volume":"170","author":[{"given":"Jiping","family":"Liu","sequence":"first","affiliation":[]},{"given":"Huishan","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00125-2_BIB1","series-title":"Proc. 9th British Combinatorics Conf.","article-title":"Surveys in combinatorics","volume":"82","author":"Bermond","year":"1983"},{"key":"10.1016\/S0012-365X(96)00125-2_BIB2","series-title":"Graph theory with applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00125-2_BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","article-title":"Induced matchings","volume":"24","author":"Cameron","year":"1989","journal-title":"Discrete App. Math."},{"key":"10.1016\/S0012-365X(96)00125-2_BIB4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","article-title":"The maximum number of edges in 2K2-free graphs of bounded degree","volume":"81","author":"Chung","year":"1990","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/S0012-365X(96)00125-2_BIB5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02579243","article-title":"On the existence of two non-neighboring subgraphs in a graph","volume":"5","author":"El-Zahar","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(96)00125-2_BIB6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(89)90163-5","article-title":"Induced matchings in bipartite graphs","volume":"78","author":"Faudree","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00125-2_BIB7","article-title":"Problems from the world surrounding perfect graphs","volume":"177","author":"Gy\u00e0rf\u00e0s","year":"1985","journal-title":"MTA Sztaki Studies"},{"key":"10.1016\/S0012-365X(96)00125-2_BIB8","unstructured":"A. Gy\u00e0rf\u00e0s, and J. Lehel. On-line and first fit colorings of graphs, J. Graph Theory, to appear."},{"key":"10.1016\/S0012-365X(96)00125-2_BIB9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02350634","article-title":"The maximum number of edges in regular 2K2-free graphs","volume":"8","author":"Paoli","year":"1992","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(96)00125-2_BIB10","unstructured":"H.J. Straight, Combinatorics, An invitation (Brooks\/Cole Publishing Company)."},{"key":"10.1016\/S0012-365X(96)00125-2_BIB11","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0095-8956(80)90093-3","article-title":"A bound on the chromatic number of graphs without certain induced subgraphs","volume":"29","author":"Wagon","year":"1980","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001252?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001252?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:26:53Z","timestamp":1553196413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96001252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96001252"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00125-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}