{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:03:24Z","timestamp":1759147404872},"reference-count":30,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":3638,"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":[[2003,8]]},"DOI":"10.1016\/s0012-365x(03)00161-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:16:17Z","timestamp":1056989777000},"page":"3-12","source":"Crossref","is-referenced-by-count":2,"title":["Subgraph trees in graph theory"],"prefix":"10.1016","volume":"270","author":[{"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00161-4_BIB1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0095-8956(82)90056-9","article-title":"Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality","volume":"33","author":"Acharya","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0024-3795(89)90706-4","article-title":"Determinantal formulae for matrix completions associated with chordal graphs","volume":"121","author":"Barrett","year":"1989","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB4","series-title":"Hypergraphs; Combinatorics of Finite Sets","author":"Berge","year":"1989"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB5","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0210059","article-title":"Power of natural semijoins","volume":"10","author":"Bernstein","year":"1981","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB6","first-page":"173","article-title":"On finding minimum-diameter clique trees","volume":"1","author":"Blair","year":"1994","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB7","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1137\/S0895480193253415","article-title":"Dually chordal graphs","volume":"11","author":"Brandst\u00e4dt","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)00091-6","article-title":"Homogeneously orderable graphs","volume":"192","author":"Brandst\u00e4dt","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB9","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.-B. Le, J.P. Spinrad, Graph Classes; A Survey, Society for Industrial and Applied Mathematics, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(83)90088-2","article-title":"Graphs whose neighborhoods have no special cycles","volume":"47","author":"Brouwer","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB11","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\/S0012-365X(03)00161-4_BIB12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB13","first-page":"64","article-title":"HT-graphs: centers, connected r-domination and Steiner trees","volume":"1","author":"Dragan","year":"1993","journal-title":"Comput. Sci. J. Moldova"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB14","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(95)00070-8","article-title":"Incidence graphs of biacyclic hypergraphs","volume":"68","author":"Dragan","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB15","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\/S0012-365X(03)00161-4_BIB16","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\/S0012-365X(03)00161-4_BIB17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/jgt.3190020209","article-title":"Perfect elimination and chordal bipartite graphs","volume":"2","author":"Golumbic","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(89)90070-7","article-title":"Counting clique trees and computing perfect elimination schemes in parallel","volume":"31","author":"Ho","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB19","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","article-title":"A characterization of distance-hereditary graphs","volume":"28","author":"Howorka","year":"1977","journal-title":"Quart. J. Math. Oxford Ser. 2"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(85)90156-6","article-title":"A characterization of totally balanced hypergraphs","volume":"57","author":"Lehel","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.7151\/dmgt.1061","article-title":"Leafage of chordal graphs","volume":"18","author":"Lin","year":"1998","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB22","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB23","first-page":"27","article-title":"How chordal graphs work","volume":"9","author":"McKee","year":"1993","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U","article-title":"Strong clique trees and strongly chordal graphs","volume":"33","author":"McKee","year":"2000","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB25","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0012-365X(00)00103-5","article-title":"Induced cycle structure and outerplanarity","volume":"223","author":"McKee","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB26","first-page":"73","article-title":"Maximal connected cographs in distance-hereditary graphs","volume":"57","author":"McKee","year":"2000","journal-title":"Utilitas Math."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB27","doi-asserted-by":"crossref","unstructured":"T.A. McKee, F.R. McMorris, Topics in Intersection Graph Theory, Society for Industrial and Applied Mathematics, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719802"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB28","unstructured":"F. Nicolai, A hypertree characterization of distance-hereditary graphs, Manuscript, Gerhard-Mercator-Universit\u00e4t, Duisburg, 1996."},{"key":"10.1016\/S0012-365X(03)00161-4_BIB29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02941616","article-title":"Representing triangulated graphs in stars","volume":"62","author":"Prisner","year":"1992","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/S0012-365X(03)00161-4_BIB30","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 Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001614?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001614?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:28:48Z","timestamp":1552930128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0012365X03001614"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00161-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}