Orientations Acycliques et le Polynôme Chromatique

European Journal of Combinatorics

Volumn 22, Issue 8, 2001, Pages 1101-1123

  Lass, Bodo ^a,b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITÉ DE STRASBOURG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035595038     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.2001.0537     Document Type: Article

References (29)

1. B. Bollobás, Modern Graph Theory, Springer-Verlag, Berlin, 1998.
2. M. Bousquet-Mélou, q-Énumération de polyominos convexes, J. Comb. Theory, Ser. A, 64 (1993), 265-288.
3. F. Brenti, Expansions of chromatic polynomials and log-concavity, Trans. Am. Math. Soc., 332 (1992), 729-756.
4. T. H. Brylawski et J. G. Oxley, The Tutte polynomial and its applications, in: Matroid Applications, N. White (ed.), Cambridge University Press, Cambridge, 1992, pp. 123-225.
5. P. Cartier et D. Foata, Problèmes Combinatoires de Commutation et Réarrangements, Springer-Verlag, Berlin, 1969.
6. H. Crapo, A higher invariant for matroids, J. Comb. Theory, 2 (1967), 406-417.
7. D. Foata, A noncommutative version of the matrix inversion formula, Adv. Math., 31 (1979), 330-349.
8. E. R. Gansner et K. P. Vo, The chromatic generating function, Linear and Multilinear Algeb., 22 (1987), 87-93.
9. D. D. Gebhard et B. E. Sagan, Sinks in acyclic orientations of graphs, J. Comb. Theory, Ser. B, 80 (2000), 130-146.
10. I. M. Gessel, Acyclic orientations and chromatic generating functions, Discrete Math., 232 (2001), 119-130.
11. I. M. Gessel, Counting acyclic digraphs by sources and sinks, Discrete Math., 160 (1996), 253-258.
12. C. Greene et T. Zaslavsky, On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-radon partitions, and orientations of graphs, Trans. Am. Math. Soc., 280 (1983), 97-126.
13. A. Huck, Flüsse und Wege in Graphen, Bonn, 1997.
14. B. Lass, Funktionen zählen, Diplomarbeit, Bonn, Germany, 1997.
15. N. Linial, Graph colouring and monotone functions on posets, Discrete Math., 58 (1986), 97-98.
16. V. A. Liskovec, O chisle maksimalnyh vershin sluchajnogo aciklicheskogo orgrafa, Teor. Verojatnost. i Primenen., 20 (1975), 412-421.
17. L. Lovász, Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest, 1993.
18. R. W. Robinson, Counting labeled acyclic digraphs, in: New Directions in the Theory of Graphs, Proc. Third Ann Arbor Conference on Graph Theory, F. Harary (ed.), Academic Press, New York, 1971, pp. 239-273.
19. V. I. Rodionov, Javnaja formula dlja chisla pomechennyh aciklicheskih orientirovannyh grafov, Avtomorfnye funkcii i teorija chisel, Sb. nauch. tr., Izhevsk, (1987), 22-25.
20. H. Sachs, Einführung in die Theorie der endlichen Graphen, Teil II, BSB B. G. Teubner Verlagsgesellschaft, 1972.
21. R. P. Stanley, Acyclic orientations of graphs, Discrete Math., 5 (1973), 171-178.
22. R. P. Stanley, A symmetric function generalization of the chromatic polynomial of a graph, Adv. Math., 111 (1995), 166-194.
23. R. P. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge University Press, Cambridge, 1997.
24. V. Strehl, Counting domino tilings of rectangles via resultants, à paraître dans, Adv. Appl. Math., (2001).
25. I. Tomescu, Graphical Eulerian numbers and chromatic generating functions, Discrete Math., 66 (1987), 315-318.
26. W. T. Tutte, Graph Theory, Addison-Wesley, Reading, MA, 1984.
27. G. X. Viennot, Heaps of pieces, I: Basic definitions and combinatorial lemmas, in: Combinatoire Énumérative, Proc. Colloq., (Montréal, 1985), Lecture Notes in Mathematics, 1986, 1234, pp. 321-350.
28. D. J. A. Welsh, Counting colourings and flows in random graphs, Combinatorics, Paul Erdös is Eighty, Vol. 2, Keszthely, Hungary, 1993; Bolyai Soc. Math. Stud., 2 (1996), 491-505.
29. D. J. A. Welsh, Counting colourings and flows in random graphs, Combinatorics, Paul Erdös is Eighty, Vol. 2, Keszthely, Hungary, 1993; Bolyai Soc. Math. Stud., 2 (1996), 491-505.