{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:24:56Z","timestamp":1648823096970},"reference-count":15,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5662,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Graph Theory"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1002\/(sici)1097-0118(200003)33:3<151::aid-jgt5>3.0.co;2-u","type":"journal-article","created":{"date-parts":[[2004,11,14]],"date-time":"2004-11-14T04:54:39Z","timestamp":1100408079000},"page":"151-160","source":"Crossref","is-referenced-by-count":3,"title":["Strong clique trees, neighborhood trees, and strongly chordal graphs"],"prefix":"10.1002","volume":"33","author":[{"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph theory and sparse matrix computation","author":"Blair","year":"1993","unstructured":"and ?An introduction to chordal graphs and clique trees,? Graph theory and sparse matrix computation, et al., (Editors), Springer, New York, 1993, pp. 1-29."},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(91)90023-P","volume":"32","author":"Brandst\u00e4dt","year":"1991","journal-title":"Discrete Appl Math"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB3","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"Brandst\u00e4dt","year":"1998","journal-title":"SIAM J Discrete Math"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(83)90088-2","volume":"47","author":"Brouwer","year":"1983","journal-title":"Discrete Math"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB5","first-page":"64","volume":"1","author":"Dragan","year":"1993","journal-title":"Comp Sci J Moldova"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(95)00070-8","volume":"68","author":"Dragan","year":"1996","journal-title":"Discrete Appl Math"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB7","first-page":"381","volume-title":"Hypergraphs","volume":"1","author":"Duchet","year":"1995","unstructured":"?Hypergraphs,? Handbook of combinatorics, Vol. 1, et al. (Editors), Elsevier, Amsterdam, 1995, pp. 381-432."},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB9","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-60618-1_88","volume-title":"Graph-theoretic concepts in computer science","volume":"107","author":"Galinier","year":"1995","unstructured":"and ?Chordal graphs and their clique graphs,? Graph-theoretic concepts in computer science, Lecture Notes in Computer Science, 107, (Editors), Springer, Berlin, 1995, pp. 358-371."},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB10","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic","year":"1980","unstructured":"Algorithmic graph theory and perfect graphs, Academic, San Diego, 1980."},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<199::AID-JGT9>3.0.CO;2-M","volume":"21","author":"Gutierrez","year":"1996","journal-title":"J Graph Theory"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(85)90156-6","volume":"57","author":"Lehel","year":"1985","journal-title":"Discrete Math"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB13","series-title":"Lecture Notes","first-page":"87","volume-title":"Combinatorial designs and applications","volume":"126","author":"Ma","year":"1990","unstructured":"and ?Characterizing strongly chordal graphs by using minimal relative separators,? Combinatorial designs and applications, et al. (Editors), Lecture Notes in Pure and Applied Mathematics 126, Marcel Dekker, New York, 1990, pp. 87-95."},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB14","author":"McKee","year":"1999","journal-title":"Soc Indust Appl Math"},{"key":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U-BIB15","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/S0895480191223191","volume":"7","author":"Szwarcfiter","year":"1994","journal-title":"SIAM J Discrete Math"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0118(200003)33:3%3C151::AID-JGT5%3E3.0.CO;2-U","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0118(200003)33:3%3C151::AID-JGT5%3E3.0.CO;2-U","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T09:13:07Z","timestamp":1625130787000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,3]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0118(200003)33:3<151::aid-jgt5>3.0.co;2-u","relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}