{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T06:44:58Z","timestamp":1767422698116},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"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":[[2002,3]]},"DOI":"10.1016\/s0166-218x(00)00336-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T03:52:51Z","timestamp":1027569171000},"page":"109-131","source":"Crossref","is-referenced-by-count":18,"title":["Clique tree generalization and new subclasses of chordal graphs"],"prefix":"10.1016","volume":"117","author":[{"given":"P.Sreenivasa","family":"Kumar","sequence":"first","affiliation":[]},{"given":"C.E.Veni","family":"Madhavan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00336-X_BIB1","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."},{"issue":"1","key":"10.1016\/S0166-218X(00)00336-X_BIB2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00336-X_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\/S0166-218X(00)00336-X_BIB4","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\/S0166-218X(00)00336-X_BIB5","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. of Math."},{"key":"10.1016\/S0166-218X(00)00336-X_BIB6","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":"116","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(00)00336-X_BIB7","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/0196-6774(87)90053-8","article-title":"Generating the maximum spanning trees of a weighted graph","volume":"8","author":"Gavril","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00336-X_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(00)00336-X_BIB9","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\/S0166-218X(00)00336-X_BIB10","unstructured":"J.W. Moon, Various proofs of Cayley's formula for counting trees, in: F. Harary (Ed.), A Seminar on Graph Theory, Holt, Rinehart and Winston, New York, 1967, pp. 70\u201378."},{"key":"10.1016\/S0166-218X(00)00336-X_BIB11","doi-asserted-by":"crossref","unstructured":"J. Naor, M. Naor, A.A. Schaffer, Fast parallel algorithms for chordal graphs, ACM Symposium on Theory of Computing, 1987, pp. 355\u2013363.","DOI":"10.1145\/28395.28433"},{"key":"10.1016\/S0166-218X(00)00336-X_BIB12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0012-365X(84)90164-X","article-title":"Separating subgraphs in k-trees: cables and caterpillars","volume":"49","author":"Proskurowski","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00336-X_BIB13","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1002\/jgt.3190120313","article-title":"On the tree representation of chordal graphs","volume":"12","author":"Shibata","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(00)00336-X_BIB14","unstructured":"P. Sreenivasa Kumar, Algorithmic and structural results on chordal graphs, Ph.D. Thesis, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India, September 1990."},{"key":"10.1016\/S0166-218X(00)00336-X_BIB15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(98)00123-1","article-title":"Minimal vertex separators of chordal graphs","volume":"89","author":"Sreenivasa Kumar","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00336-X_BIB16","unstructured":"P. Sreenivasa Kumar, C.E. Veni Madhavan, 2-separator Chordal graphs, Proceedings of the Third National Symposium on Theoretical Computer Science, Kharagpur, June 1993, pp. 37\u201352."},{"issue":"3","key":"10.1016\/S0166-218X(00)00336-X_BIB17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00336-X_BIB18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(92)90254-S","article-title":"A linear-time algorithm for isomorphism of a subclass of chordal graphs","volume":"44","author":"Veeraraghavulu","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00336-X_BIB19","doi-asserted-by":"crossref","unstructured":"F.S. Roberts, ed., Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, Vol. 17, The IMA volumes in Mathematics and Applications, Springer, 1989.","DOI":"10.1007\/978-1-4684-6381-1"},{"key":"10.1016\/S0166-218X(00)00336-X_BIB20","first-page":"138","article-title":"Trees with Hamiltonian squares","volume":"18","author":"Harary and A.J. Schwenk","year":"1971","journal-title":"Mathematica"},{"key":"10.1016\/S0166-218X(00)00336-X_BIB21","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190030302","article-title":"On double and multiple interval graphs","volume":"3","author":"Trotter and F. Harary","year":"1979","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000336X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000336X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T13:47:48Z","timestamp":1578404868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0000336X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X0000336X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00336-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}