Acyclic orientations and chromatic generating functions

Discrete Mathematics

Volumn 232, Issue 1-3, 2001, Pages 119-130

  Gessel, Ira M ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

Acyclic orientation; Chromatic polynomial

Indexed keywords

EID: 0035815354     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00344-7     Document Type: Article

References (18)

1. M. Bousquet-Mélou, q-Énumeration de polyominos convexes, J. Combin. Theory Ser. A 64 (1993) 265-288.
2. F. Brenti, Expansions of chromatic polynomials and log-concavity, Trans. Amer. Math. Soc. 332 (1992) 729-756.
3. T. Brylawsk, J. Oxley, The Tutte Polynomial and Its Applications, in: N. White (Ed.), Matroid Applications, Encyclopedia of Mathematics and its Applications, Vol. 40, Cambridge University Press, Cambridge, 1991, pp. 123-225.
4. P. Cartier, D. Foata, Problèmes Combinatoires de Commutation et Réarrangement, Lecture Notes in Mathematics, Vol. 85, Springer, Berlin, 1969.
5. V. Diekert, Combinatorics on Traces, Lecture Notes in Computer Science, Vol. 454, Springer, Berlin, 1990.
6. D. Foata, A noncommutative version of the matrix inversion formula, Adv. Math. 31 (1979) 330-339.
7. E.R. Gansner, K.P. Vo, The chromatic generating function, Linear and Multilinear Algebra 22 (1987) 87-93.
8. I.M. Gessel, Counting acyclic digraphs by sources and sinks, Discrete Math. 160 (1996) 253-258.
9. C. Greene, T. Zaslavsky, On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs, Trans. Amer. Math. Soc. 280 (1983) 97-126.
10. N. Linial, Graph coloring and monotone functions on posets, Discrete Math. 58 (1986) 97-98.
11. A. Mazurkiewicz, Trace theory, in: G. Goos, J. Hartmanis (Eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Computer Science, Vol. 255, Springer, Berlin, 1987, pp. 279-324.
12. R.P. Stanley, Ordered structures and partitions, Mem. Amer. Math. Soc. 119 (1972).
13. R.P. Stanley, Acyclic orientations of graphs, Discrete Math. 5 (1973) 171-178.
14. R.P. Stanley, Combinatorial reciprocity theorems, Adv. Math. 14 (1974) 194-253.
15. R.P. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth & Brooks/Cole Monterey, CA, 1986.
16. I. Tomescu, Graphical Eulerian numbers and chromatic generating functions, Discrete Math 66 (1987) 315-318.
17. G.X. Viennot, Heaps of pieces, I: basic definitions and combinatorial lemmas, in: G. Labelle, P. Leroux (Eds.), Combinatoire Enumerative, Proceedings, Montréal, Québec 1985, Lecture Notes in Mathematics, Vol. 1234, Springer, Berlin, 1986, pp. 321-350.
18. H.S. Wilf, Which polynomials are chromatic? Colloquio Internazionale sulle Teorie Combinatorie Roma, 1973, Tomo I Atti dei Convegni Lincei No. 17, Accademia Naz. Lincei, Rome 1976, pp. 247-256.