{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T01:04:46Z","timestamp":1787706286017,"version":"build-2784847793"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1016\/0166-218x(92)90275-f","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T16:10:39Z","timestamp":1039536639000},"page":"97-102","source":"Crossref","is-referenced-by-count":218,"title":["Induced matchings"],"prefix":"10.1016","volume":"24","author":[{"given":"Kathie","family":"Cameron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90275-F_BIB1","first-page":"123","article-title":"Les probl\u00e9mes de colorations en th\u00e9orie des graphs","volume":"9","author":"Berge","year":"1960"},{"key":"10.1016\/0166-218X(92)90275-F_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(92)90275-F_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90275-F_BIB4","first-page":"71","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961"},{"key":"10.1016\/0166-218X(92)90275-F_BIB5","series-title":"Ph.D. thesis","article-title":"Applications of LP duality to problems involving independence and domination","author":"Farber","year":"1981"},{"key":"10.1016\/0166-218X(92)90275-F_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90275-F_BIB7","article-title":"Some polynomial algorithms for certain graphs and hypergraphs","author":"Frank","year":"1976","journal-title":"Proceeding 5th British Combin. Conf."},{"key":"10.1016\/0166-218X(92)90275-F_BIB8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/0166-218X(92)90275-F_BIB9","series-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(92)90275-F_BIB10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"lgorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90275-F_BIB11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(92)90275-F_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbie","year":"1980"},{"key":"10.1016\/0166-218X(92)90275-F_BIB13","first-page":"113","article-title":"\u00dcber die Aufl\u00f6sung von Graphen in vollst\u00e4ndige Teilgraphen","volume":"1","author":"Hajnal","year":"1958"},{"key":"10.1016\/0166-218X(92)90275-F_BIB14","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","article-title":"Totally balanced and greedy matrices","volume":"6","author":"Hoffman","year":"1985","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/0166-218X(92)90275-F_BIB15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representations of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(92)90275-F_BIB16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90275-F_BIB17","series-title":"Master's thesis","article-title":"\u0413-free matrices","author":"Lubiw","year":"1982"},{"key":"10.1016\/0166-218X(92)90275-F_BIB18","first-page":"355","article-title":"Fast parallel algorithms for chordal graphs","author":"Naor","year":"1987","journal-title":"Proceedings 19th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(92)90275-F_BIB19","series-title":"Ph.D. thesis","article-title":"Representations of rigid cycle graphs","author":"Walter","year":"1972"},{"key":"10.1016\/0166-218X(92)90275-F_BIB20","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190020311","article-title":"Representations of chordal graphs as subtrees of a tree","volume":"2","author":"Walter","year":"1978","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290275F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290275F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:55:55Z","timestamp":1555120555000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290275F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989]]}},"alternative-id":["0166218X9290275F"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90275-f","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}