{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:59:41Z","timestamp":1649087981466},"reference-count":10,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1016\/j.orl.2009.05.002","type":"journal-article","created":{"date-parts":[[2009,5,30]],"date-time":"2009-05-30T08:39:23Z","timestamp":1243672763000},"page":"351-355","source":"Crossref","is-referenced-by-count":3,"title":["A superclass of Edge-Path-Tree graphs with few cliques"],"prefix":"10.1016","volume":"37","author":[{"given":"Nicola","family":"Apollonio","sequence":"first","affiliation":[]},{"given":"Massimiliano","family":"Caramia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2009.05.002_b1","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","article-title":"The edge intersection graphs of paths in a tree","volume":"38","author":"Golumbic","year":"1985","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.orl.2009.05.002_b2","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":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.orl.2009.05.002_b3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.orl.2009.05.002_b4","series-title":"Proc. 9th Scand. Worksh. Algorithm Theory","first-page":"260","article-title":"New algorithms for enumerating all maximal cliques","volume":"vol. 3111","author":"Makino","year":"2004"},{"key":"10.1016\/j.orl.2009.05.002_b5","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1016\/j.dam.2007.05.047","article-title":"On the strong p-Helly property","volume":"156","author":"Dourado","year":"2008","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.orl.2009.05.002_b6","first-page":"239","article-title":"Helly\u2013hypergraphs and abstract interval structures","volume":"16","author":"Lehel","year":"1983","journal-title":"ARS Combinatoria"},{"key":"10.1016\/j.orl.2009.05.002_b7","first-page":"216","article-title":"Hereditary clique-Helly graphs","volume":"14","author":"Prisner","year":"1993","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"10.1016\/j.orl.2009.05.002_b8","series-title":"Combinatorial Optimization. Packing and Covering","author":"Cornu\u00e9jols","year":"2001"},{"key":"10.1016\/j.orl.2009.05.002_b9","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/j.orl.2009.05.002_b10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(83)90018-3","article-title":"Hypergraphes de Chaines d\u2019 Aretes d\u2019un Arbre","volume":"43","author":"Fournier","year":"1983","journal-title":"Discrete Mathematics"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637709000674?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637709000674?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T07:50:50Z","timestamp":1545205850000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637709000674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["S0167637709000674"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2009.05.002","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}