{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:28:05Z","timestamp":1757615285410,"version":"3.44.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8994,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0012-365x(88)90212-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"225-236","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constructions of sensitive graphs which are not strongly sensitive"],"prefix":"10.1016","volume":"72","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":[{"year":"1979","author":"Behzad","series-title":"Graphs and digraphs","key":"10.1016\/0012-365X(88)90212-9_BIB1"},{"year":"1978","author":"Gratzer","series-title":"General lattice theory","key":"10.1016\/0012-365X(88)90212-9_BIB2"},{"key":"10.1016\/0012-365X(88)90212-9_BIB3","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(88)90212-9_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 and combinatorics"},{"key":"10.1016\/0012-365X(88)90212-9_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 Mathematics"},{"key":"10.1016\/0012-365X(88)90212-9_BIB6","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:0012365X88902129?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88902129?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:35:46Z","timestamp":1757079346000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88902129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0012365X88902129"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90212-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1988,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Constructions of sensitive graphs which are not strongly sensitive","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(88)90212-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}