arXiv:math/0103229 [math.CO]AbstractReferencesReviewsResources
Symmetric function generalizations of graph polynomials
Published 2001-03-30Version 1
In Chapter 2 we study the path-cycle symmetric function of a digraph, a symmetric function generalization of Chung and Graham's cover polynomial. Most of this material appears in either Advances in Math. 118 (1996), 71-98 or J. Algebraic Combin. 10 (1999), 227-240. Chapter 3 contains miscellaneous results about Stanley's symmetric function generalization X_G of the chromatic polynomial, e.g., we establish a connection with some of Tutte's work on the chromatic polynomial and use this to prove that X_G is reconstructible. Most of Chapter 3 does not appear elsewhere.
Comments: 70 pages. This is not a new paper; it is my 1995 Ph.D. thesis
Categories: math.CO
Keywords: graph polynomials, chromatic polynomial, stanleys symmetric function generalization, path-cycle symmetric function, grahams cover polynomial
Tags: dissertation
Related articles: Most relevant | Search more
arXiv:1909.02310 [math.CO] (Published 2019-09-05)
New expressions for order polynomials and chromatic polynomials
arXiv:1604.03063 [math.CO] (Published 2016-04-11)
A note on non-broken-circuit sets and the chromatic polynomial
arXiv:1611.04245 [math.CO] (Published 2016-11-14)
Do hypergraphs have properties on chromatic polynomials not owned by graphs