{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:52:52Z","timestamp":1695603172425},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"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":9847,"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":[[1986,8]]},"DOI":"10.1016\/0012-365x(86)90028-2","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"61-70","source":"Crossref","is-referenced-by-count":5,"title":["On the uniformity of the closed-set lattice of a tree"],"prefix":"10.1016","volume":"61","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(86)90028-2_BIB1","series-title":"Graphs and Diagraphs","author":"Behzad","year":"1979"},{"key":"10.1016\/0012-365X(86)90028-2_BIB2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(84)90147-X","article-title":"On the grading numbers of direct products of chains","volume":"49","author":"Chen","year":"1984","journal-title":"Discrete Math"},{"key":"10.1016\/0012-365X(86)90028-2_BIB3","series-title":"General Lattice Theory","author":"Gratzer","year":"1978"},{"key":"10.1016\/0012-365X(86)90028-2_BIB4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00383605","article-title":"On an isomorphism problem on the closed-set lattice of a graph","volume":"1","author":"Koh","year":"1985","journal-title":"Order"},{"key":"10.1016\/0012-365X(86)90028-2_BIB5","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 and Combinatorics"},{"key":"10.1016\/0012-365X(86)90028-2_BIB6","series-title":"Proc. First Southeast Asian Coll. Graph Theory","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:0012365X86900282?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86900282?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:53:12Z","timestamp":1553932392000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X86900282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,8]]}},"alternative-id":["0012365X86900282"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(86)90028-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}