{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T17:10:42Z","timestamp":1708362642293},"reference-count":35,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T00:00:00Z","timestamp":1436140800000},"content-version":"vor","delay-in-days":1466,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1016\/j.dam.2011.02.008","type":"journal-article","created":{"date-parts":[[2011,4,18]],"date-time":"2011-04-18T15:34:08Z","timestamp":1303140848000},"page":"1166-1175","source":"Crossref","is-referenced-by-count":5,"title":["Recognizing Helly Edge-Path-Tree graphs and their clique graphs"],"prefix":"10.1016","volume":"159","author":[{"given":"Nicola","family":"Apollonio","sequence":"first","affiliation":[]},{"given":"Massimiliano","family":"Caramia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2011.02.008_br000005","doi-asserted-by":"crossref","first-page":"4181","DOI":"10.1016\/j.disc.2008.10.004","article-title":"Integrality properties of edge path tree families","volume":"309","author":"Apollonio","year":"2009","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2011.02.008_br000010","unstructured":"N. Apollonio, M. Caramia, A local structure result for line graphs of strong quasi-graphical matrices, Technical Report, University of Rome Tor Vergata, DII RR-08.09, 2009."},{"key":"10.1016\/j.dam.2011.02.008_br000015","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/j.dam.2011.02.008_br000020","series-title":"Hypergraphes, Combinatoire des Ensembles Finis","author":"Berge","year":"1987"},{"key":"10.1016\/j.dam.2011.02.008_br000025","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.5.3.321","article-title":"Converting linear programs to network problems","volume":"5","author":"Bixby","year":"1980","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.dam.2011.02.008_br000030","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","article-title":"An almost linear time algorithm for graph realization","volume":"13","author":"Bixby","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.dam.2011.02.008_br000035","series-title":"Graph Classes: A Survey","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/j.dam.2011.02.008_br000040","doi-asserted-by":"crossref","unstructured":"K. Cameron, C. Ho\u00e0ng, Benjamin L\u00e9v\u00eaque, Asteroids in rooted and directed path graphs, Research Report Leibniz, vol. 175, 2008.","DOI":"10.1016\/j.endm.2009.02.010"},{"issue":"2","key":"10.1016\/j.dam.2011.02.008_br000045","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1002\/net.20281","article-title":"Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion","volume":"53","author":"Catanzaro","year":"2009","journal-title":"Networks"},{"key":"10.1016\/j.dam.2011.02.008_br000050","series-title":"Combinatorial Optimization. Packing and Covering","author":"Cornu\u00e9jols","year":"2001"},{"key":"10.1016\/j.dam.2011.02.008_br000055","series-title":"Handbook of Combinatorics","first-page":"381","article-title":"Hypergraphs","author":"Duchet","year":"1995"},{"key":"10.1016\/j.dam.2011.02.008_br000060","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2011.02.008_br000065","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"},{"key":"10.1016\/j.dam.2011.02.008_br000070","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(80)90042-2","article-title":"An efficient PQ-graph algorithm for solving the graph-realization problem","volume":"21","author":"Fujishige","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.dam.2011.02.008_br000075","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graphs of directed paths in directed trees","volume":"13","author":"Gavril","year":"1975","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2011.02.008_br000080","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90003-1","article-title":"A recognition algorithm for the intersection graphs of paths in trees","volume":"23","author":"Gavril","year":"1978","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2011.02.008_br000085","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/j.dam.2011.02.008_br000090","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.dam.2011.02.008_br000095","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(85)90043-3","article-title":"Edge and vertex intersection of paths in a tree","volume":"55","author":"Golumbic","year":"1985","journal-title":"Discrete Mathematics"},{"issue":"2\u20133","key":"10.1016\/j.dam.2011.02.008_br000100","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0166-218X(02)00203-2","article-title":"Recognizing clique graphs of directed edge path graphs","volume":"126","author":"Gutierrez","year":"2003","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/j.dam.2011.02.008_br000105","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1590\/S0104-65002001000200008","article-title":"Algebraic theory for the clique operator","volume":"7","author":"Gutierrez","year":"2002","journal-title":"Journal of the Brazilian Computer Society"},{"key":"10.1016\/j.dam.2011.02.008_br000110","first-page":"239","article-title":"Helly-hypergraphs and abstract interval structures","volume":"16","author":"Lehel","year":"1983","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.dam.2011.02.008_br000115","series-title":"Proc. 9th Scand. Worksh. Algorithm Theory, SWAT 2004","first-page":"260","article-title":"New algorithms for enumerating all maximal cliques","volume":"vol. 3111","author":"Makino","year":"2004"},{"key":"10.1016\/j.dam.2011.02.008_br000120","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.dam.2011.02.008_br000125","first-page":"216","article-title":"Hereditary clique-Helly graphs","volume":"14","author":"Prisner","year":"1993","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"issue":"1\u20133","key":"10.1016\/j.dam.2011.02.008_br000130","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 Mathematics"},{"key":"10.1016\/j.dam.2011.02.008_br000135","doi-asserted-by":"crossref","first-page":"501","DOI":"10.2140\/pjm.1970.34.501","article-title":"Intersection representations of graphs by arcs","volume":"34","author":"Renz","year":"1970","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/j.dam.2011.02.008_br000140","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1137\/0117056","article-title":"Combinatorial configurations","volume":"17","author":"Ryser","year":"1969","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/j.dam.2011.02.008_br000145","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/j.dam.2011.02.008_br000150","series-title":"Combinatorial Optimization. Polyhedra and Efficiency","author":"Schrijver","year":"2003"},{"key":"10.1016\/j.dam.2011.02.008_br000155","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(95)80005-O","article-title":"The arborescence-realization problem","volume":"59","author":"Swaminathan","year":"1995","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10.1016\/j.dam.2011.02.008_br000160","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0012-365X(85)90050-0","article-title":"Triangulated edge intersection graphs of paths in a tree","volume":"55","author":"Syslo","year":"1985","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2011.02.008_br000165","series-title":"Matroid Decomposition","author":"Truemper","year":"1992"},{"key":"10.1016\/j.dam.2011.02.008_br000170","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.dam.2011.02.008_br000175","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X11000898?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X11000898?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,21]],"date-time":"2021-11-21T21:01:57Z","timestamp":1637528517000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X11000898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":35,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S0166218X11000898"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2011.02.008","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}