{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:38Z","timestamp":1720640738144},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00233-1","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"94-97","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The Clique Operator, Set Families, and Their Properties"],"prefix":"10.1016","volume":"7","author":[{"given":"Marisa","family":"Gutierrez","sequence":"first","affiliation":[]},{"given":"Joao","family":"Meidanis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00233-1_BIB1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0095-8956(91)90004-4","article-title":"Clique graphs and Helly graphs","volume":"51","author":"Bandelt","year":"1991","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S1571-0653(04)00233-1_BIB2","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/S0021-9800(68)80055-9","article-title":"A partial characterization of clique graphs","volume":"5","author":"Hamelink","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S1571-0653(04)00233-1_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","article-title":"Intersection graphs of paths in a tree","volume":"41","author":"Monma","year":"1986","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S1571-0653(04)00233-1_BIB4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0166-218X(99)00028-1","article-title":"Recognizing clique graphs of directed and rooted path graphs","volume":"94","author":"Prisner","year":"1999","journal-title":"Discrete Applied Math."},{"key":"10.1016\/S1571-0653(04)00233-1_BIB5","series-title":"Graph Dynamics. Number 338 in Pitman Research Notes in Mathematical Series","author":"Prisner","year":"1995"},{"key":"10.1016\/S1571-0653(04)00233-1_BIB6","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0095-8956(71)90070-0","article-title":"A characterization of clique graphs","volume":"10","author":"Roberts","year":"1971","journal-title":"J. Combin. Theory B"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002331?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002331?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:50:37Z","timestamp":1548597037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304002331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":6,"alternative-id":["S1571065304002331"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00233-1","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}