A weighted analogue of the chromatic symmetric function, valued in MacMahon symmetric functions on two alphabets, determines, for every tree, the generating function of vertex subsets by cardinality, weight, and internal and external edge counts.
173, Springer, Berlin, 2018, Free version available at diestel-graph-theory.com https://diestel-graph-theory.com
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Chromatic MacMahon symmetric functions of graphs
A weighted analogue of the chromatic symmetric function, valued in MacMahon symmetric functions on two alphabets, determines, for every tree, the generating function of vertex subsets by cardinality, weight, and internal and external edge counts.