[1] A. Baldisserri, E. Rubei On graphlike k-dissimilarity vectors, to appear in Annals of Combinatorics
[2] H-J Bandelt, M.A. Steel Symmetric matrices representable by weighted trees over acancellative abelian monoid. SIAM J. Disc. Math. 8 (1995)
[3] Buneman, A note on the metric properties of trees, Journal of Combinatorial Theory, 1974
[4] S.Herrmann, K.Huber, V.Moulton, A.Spillner, Recognizing treelike k-dissimilarities. Journal of Classification 29 (2012)
[5] S.L. Hakimi, A.N. Patrinos The distance matrix of a graph and its tree realization. Quart. Appl. Math. 30 (1972/73)
[6] S.L. Hakimi, S.S. Yau, Distance matrix of a graph and its realizability. Quart. Appl. Math. 22 (1965)
[7] L. Pachter, D. Speyer Reconstructing trees from subtree weights. Appl. Math. Lett. 17 (2004)