References to Combinatorial Counting

Back to course homepage.
  1. R. Arratia, B. Bollobas and G. Sorkin, The Interlace polynomial: A new graph polynomial IBM preprint, July 2000 ps-file .

  2. B. Bollobas and O.Riordan, A Tutte Polynomial for Coloured Graphs, Combinatorics, Probability and Computing, Volume 8 - Issue 1&2 - January 199, pp 45-93 ps-file .

  3. J.A. Makowsky and J.P. Marino
    Farrell polynomials on graphs of bounded tree width
    Extended Abstract (Revised 20.11.2000) , accepted for publication in the proceedings of FPSAC'01

  4. J.A. Makowsky,
    Colored Tutte Polynomials and Kauffman Brackets for Graphs of Bounded Tree Width
    Abstract , Extended Abstract , as sent for publication in proceedings (Oct 2000), of SODA'01

  5. S.D. Noble, The complexity of graph polynomials, Ph.D. Thesis, Oxford, 1997 ps-file .

  6. J. Oxley and G. Whittle, A Characterization of Tutte Invariants of 2-Polymatroids, Journal of Combinatorial Theory, Series B, vol 59.2 (1993) pp. 210-244. pdf-file .