{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:28:52Z","timestamp":1773944932113,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0012-365x(83)90154-1","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:00:52Z","timestamp":1032282052000},"page":"173-189","source":"Crossref","is-referenced-by-count":268,"title":["Characterizations of strongly chordal graphs"],"prefix":"10.1016","volume":"43","author":[{"given":"Martin","family":"Farber","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"A","key":"10.1016\/0012-365X(83)90154-1_BIB1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0097-3165(80)90008-4","article-title":"Properites of (0,1)-matrices with no triangles","volume":"29","author":"Anstee","year":"1980","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(83)90154-1_BIB2","doi-asserted-by":"crossref","unstructured":"R.P. Anstee, Hypergraphs with no special cycles, submitted to Combinatorica.","DOI":"10.1007\/BF02579287"},{"key":"10.1016\/0012-365X(83)90154-1_BIB3","doi-asserted-by":"crossref","unstructured":"R.P. Anstee and M. Farber, Characterizations of totally balanced matrices, submitted to J. of Algorithms.","DOI":"10.1016\/0196-6774(84)90028-2"},{"key":"10.1016\/0012-365X(83)90154-1_BIB4","series-title":"Dominating sets in chordal graphs","author":"Booth","year":"1980"},{"key":"10.1016\/0012-365X(83)90154-1_BIB5","unstructured":"G. Chang, Personal communications (1982) (to be included in his Ph.D. thesis, School of Operations Research and Industrial Engineering, Cornell University)."},{"key":"10.1016\/0012-365X(83)90154-1_BIB6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(83)90154-1_BIB7","series-title":"Ph.D. Thesis","article-title":"Applications of 1.p. duality to problems involving independence and domination","author":"Farber","year":"1982"},{"key":"10.1016\/0012-365X(83)90154-1_BIB8","unstructured":"M. Farber, Domination, independent domination, and duality in strongly chordal graphs, submitted to Discrete Applied Math."},{"issue":"B","key":"10.1016\/0012-365X(83)90154-1_BIB9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees of trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(83)90154-1_BIB10","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(83)90154-1_BIB11","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(83)90154-1_BIB12","unstructured":"A.J. Hoffman, A.W.J. Kolen and M. Sakarovitch, Totally-balanced and greedy matrices, submitted to SIAM J. Algebraic Discrete Methods."},{"key":"10.1016\/0012-365X(83)90154-1_BIB13","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0012-365X(83)90154-1_BIB14","author":"Lubiw","year":"1981","journal-title":"Personal communication"},{"key":"10.1016\/0012-365X(83)90154-1_BIB15","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Traingulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0012-365X(83)90154-1_BIB16","series-title":"Technical Report No. 540","article-title":"The k-domination and k-stability problems on graphs","author":"Chang","year":"1982"},{"key":"10.1016\/0012-365X(83)90154-1_BIB17","series-title":"A bipartite representation of a triangulated graph and its chordality","author":"Iijima","year":"1979"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901541?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901541?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T16:24:07Z","timestamp":1554827047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83901541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":17,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83901541"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90154-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}