{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:16:30Z","timestamp":1648649790985},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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":[[1996,5]]},"DOI":"10.1016\/0012-365x(94)00090-6","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"121-130","source":"Crossref","is-referenced-by-count":0,"title":["On the lower length of the closed-set lattice of a tree"],"prefix":"10.1016","volume":"151","author":[{"given":"K.M.","family":"Koh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.S.","family":"Poh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00090-6_BIB1","series-title":"Graphs and Digraphs","author":"Behzad","year":"1979"},{"key":"10.1016\/0012-365X(94)00090-6_BIB2","series-title":"General Lattice Theory","author":"Gr\u00e4tzer","year":"1978"},{"key":"10.1016\/0012-365X(94)00090-6_BIB3","first-page":"285","article-title":"On an isomorphism problem on the closed-set lattice of a graph","author":"Koh","year":"1985"},{"key":"10.1016\/0012-365X(94)00090-6_BIB4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02582951","article-title":"On a construction of critical graphs which are not sensitive","volume":"1","author":"Koh","year":"1985","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(94)00090-6_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(86)90028-2","article-title":"On the uniformity of the closed-set lattice of a tree","volume":"61","author":"Koh","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00090-6_BIB6","first-page":"163","article-title":"Vertex-gluings of graphs with their closed-set lattices","volume":"23A","author":"Koh","year":"1987","journal-title":"Ars. Combin."},{"key":"10.1016\/0012-365X(94)00090-6_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(88)90053-2","article-title":"Products of graphs with their closed-set lattices","volume":"69","author":"Koh","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00090-6_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(88)90212-9","article-title":"Constructions of sensitive graphs which are not strongly sensitive","volume":"72","author":"Koh","year":"1988","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/0012-365X(94)00090-6_BIB9","first-page":"71","article-title":"The thickness and the closed-set lattice of a graph","volume":"16","author":"Koh","year":"1988","journal-title":"Bull. Inst. Math. Acad. Sinica"},{"key":"10.1016\/0012-365X(94)00090-6_BIB10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1749-6632.1989.tb16410.x","article-title":"On the sequence of closed-set lattices of a graph","volume":"576","author":"Koh","year":"1989","journal-title":"Ann. New York Acad. Sci."},{"issue":"1","key":"10.1016\/0012-365X(94)00090-6_BIB11","first-page":"33","article-title":"Vertex-gluings of sensitive graphs","volume":"15","author":"Koh","year":"1991","journal-title":"Southeast Asian Bull. Math."},{"key":"10.1016\/0012-365X(94)00090-6_BIB12","first-page":"253","article-title":"On the spectrum of the closed-set lattice of a graph","volume":"5","author":"Koh","year":"1992","journal-title":"Austral. J. Combin."},{"key":"10.1016\/0012-365X(94)00090-6_BIB13","series-title":"Proc. 1st Southeast Asian Graph Theory Coll","first-page":"100","article-title":"Concentric subgraphs, closed subsets and dense graphs","volume":"Vol. 1073","author":"Koh","year":"1984"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94000906?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94000906?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:23:36Z","timestamp":1556130216000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94000906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0012365X94000906"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00090-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}