On distinguishing trees by their chromatic symmetric functions
Authors:
- 1 February 2008
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 115 (2) , 237-253
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Non-isomorphic caterpillars with identical subtree dataDiscrete Mathematics, 2006
- HOW TO COUNT TREES?International Journal of Modern Physics C, 2005
- A Chromatic Symmetric Function in Noncommuting VariablesJournal of Algebraic Combinatorics, 2001
- The Polychromate and a Chord Diagram PolynomialAnnals of Combinatorics, 2000
- A weighted graph polynomial from chromatic invariants of knotsAnnales de l'institut Fourier, 1999
- Trees with the same degree sequence and path numbersDiscrete Mathematics, 1995
- Brick tabloids and the connection matrices between bases of symmetric functionsDiscrete Applied Mathematics, 1991
- Tutte polynomials for treesJournal of Graph Theory, 1991
- Intersection theory for graphsJournal of Combinatorial Theory, Series B, 1981
- The Reconstruction of a Tree from its Maximal SubtreesCanadian Journal of Mathematics, 1966