{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:18Z","timestamp":1720640838530},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80149-0","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"152-154","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Generalized trees related with tree metrics"],"prefix":"10.1016","volume":"5","author":[{"given":"Alain","family":"Gu\u00e9noche","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Leclerc","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Makarenkov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80149-0_BIB1","series-title":"Combinatorial Theory","author":"Aigner","year":"1979"},{"key":"10.1016\/S1571-0653(05)80149-0_BIB2","first-page":"69","article-title":", Characterization and recognition of partial k- trees","volume":"47","author":"Arnborg","year":"1989","journal-title":"Congr. Numer."},{"key":"10.1016\/S1571-0653(05)80149-0_BIB3","unstructured":"J.P. Barth\u00e9lemy, A. Gu\u00e9noche, Les arbres et les representations des proximites, Masson, Paris, 1988. Transl. Trees and proximity representations, Wiley, New York, 1991."},{"key":"10.1016\/S1571-0653(05)80149-0_BIB4","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1137\/0404043","article-title":"Deterministic decomposition of recursive graph classes","volume":"4","author":"Borie","year":"1991","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/S1571-0653(05)80149-0_BIB5","series-title":"Mathematics in Archaeological and Historical Sciences","first-page":"387","article-title":"The Recovery of Trees from Measures of Dissimilarity","author":"Buneman","year":"1971"},{"key":"10.1016\/S1571-0653(05)80149-0_BIB6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/0604006","article-title":"An optimal diagonal tree-code","volume":"4","author":"Chaiken","year":"1983","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"10.1016\/S1571-0653(05)80149-0_BIB7","author":"Gu\u00e9noche","year":"1999","journal-title":"The triangles method to build phylogenetic trees from incomplete distance matrices"},{"key":"10.1016\/S1571-0653(05)80149-0_BIB8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0012-365X(98)00073-9","article-title":"On some relations between 2-trees and tree metrics","volume":"192","author":"Leclerc","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S1571-0653(05)80149-0_BIB9","doi-asserted-by":"crossref","unstructured":"R.E. Pippert, LW. Beineke, Characterizations of 2-dimensional trees, The Many Facets of Graph Theory, G. Chartrand and S.F. Kapoor, eds, Lecture Notes in Mathematics 110, Springer-Verlag, Berlin, 1969, p. 263-270.","DOI":"10.1007\/BFb0060126"},{"key":"10.1016\/S1571-0653(05)80149-0_BIB10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","article-title":"On simple characterizations of K-trees","volume":"7","author":"Rose","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S1571-0653(05)80149-0_BIB11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0402022","article-title":"A k-tree generalization that characterizes consistency of dimensioned engineering drawings","volume":"2","author":"Todd","year":"1989","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/S1571-0653(05)80149-0_BIB12","series-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/S1571-0653(05)80149-0_BIB13","first-page":"877","article-title":"Construction of a tree with p leaves from 2p-3 elements of its distance matrix (russian)","volume":"35","author":"Yushmanov","year":"1984","journal-title":"Matematicheskie Zametki"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801490?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801490?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:17:57Z","timestamp":1586236677000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":13,"alternative-id":["S1571065305801490"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80149-0","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}