Acyclic orientations of graphs

Discrete Mathematics

Volumn 306, Issue 10-11, 2006, Pages 905-909

  Stanley, Richard P ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; FUNCTIONS; INTEGER PROGRAMMING; NUMBER THEORY; POLYNOMIALS;

CHROMATIC POLYNOMIAL; COMBINATORIAL INTERPRETATION; FINITE GRAPH; POSITIVE INTEGERS;

GRAPH THEORY;

EID: 33744537998     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.03.010     Document Type: Article

References (6)

1. E.A. Bender and J. Goldman, Enumerative uses of generating functions, Indiana Univ. Math. J. 20 (1971) 753-765.
2. P. Doubilet, G.-C. Rota and R. Stanley, On the foundations of combinatorial theory: The idea of generating function, in: Sixth Berkeley symposium on mathematical statistics and probability (1972) 267-318.
3. R. Read, The number of k-colored graphs on labelled nodes, Canad. J. Math. 12 (1960) 410-414.
4. R. Stanley, A chromatic-like polynomial for ordered sets, in: Proc. second Chapel Hill conference on combinatorial mathematics and its applications (1970) 421-427.
5. R. Stanley, Ordered structures and partitions, Mem. Am. Math. Soc. 119 (1972).
6. R. Stanley, A Brylawski decomposition for finite ordered sets, Discrete Math. 4 (1973) 77-82.