On the reconstruction of trees from their chromatic symmetric functions

We study Stanley's chromatic symmetric function (CSF) for trees when expressed in the star basis. We use the deletion-near-contraction (DNC) algorithm to compute coefficients that occur in the CSF in the star basis. In particular, one of our main results determines the smallest partition in lexicographic order that occurs as an indexing partition in the CSF, and we also give a formula for its coefficient. In addition to describing properties of trees encoded in the coefficients of the star basis, we give an algorithm for reconstructing trees of diameter less than six.