Farrell Polynomials on graphs of bounded tree width

Advances in Applied Mathematics

Volumn 30, Issue 1-2, 2003, Pages 160-176

  Makowsky, J A ^a   Marino J P ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSIDAD DE LOS ANDES   (Colombia)

Author keywords

Combinatorial enumeration; Generating functions; Graph polynomials

Indexed keywords

EID: 0038404859     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(02)00530-4     Document Type: Review

References (43)

1. R. Arratia, B. Bollobas, G.B. Sorkin, The interlace polynomial: A new graph polynomial, IBM Research Report RC 21813 (98165), 31 July 2000.
2. S. Arnborg, J. Lagergren, D. Seese, Easy problems for tree decomposable graphs, J. Algorithms 12 (1991) 308-340.
3. A. Andrzejak, An algorithm for the Tutte polynomials of graphs of bounded treewidth, Discrete Math. 190 (1998) 39-54.
4. H. Bodlaender, in: I. Privara, P. Ruzicka (Eds.), Proceedings of the 22th International Symposium on the Mathematical Foundation of Computer Science, MFCS'97, in: Lecture Notes in Comput. Sci., Vol. 1295, Springer-Verlag, 1997, pp. 29-36.
5. B. Bollobás, Graph Theory, Springer-Verlag, 1979.
6. B. Bollobás, Modern Graph Theory, Springer-Verlag, 1999.
7. K. Balasubramanian, K.R. Parthasarathy, In search for a complete invariant of graphs, in: S.B. Bao (Ed.), Combinatorics and Graph Theory, in: Lecture Notes in Math., Vol. 885, Springer-Verlag, 1980, pp. 42-59.
8. B. Bollobás, O. Riordan, A Tutte polynomial for coloured. graphs, Combin. Probab. Comput. 8 (1999) 45-94.
9. L. Babai, G. Turán, The complexity of defining a relation on a inite graph, Z. Math. Logik Grundlag. Math. 33 (1987) 277-288.
10. B. Courcelle, J.A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst. 33 (2) (2000) 125-150.
11. B. Courcelle, J.A. Makowsky, U. Rotics, On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic, Discrete Appl. Math. 108 (1-2) (2001) 23-52.
12. B. Courcelle, Monadic second-order logic of graphs VII: Graphs as relational structures, Theoret. Comput. Sci. 101 (1992) 3-33.
13. R.G. Downey, M.F. Fellows, Parametrized Complexity, Springer-Verlag, 1999.
14. R. Diestel, Graph Theory, in: Graduate Texts in Math., Springer-Verlag, 1996.
15. M. de Rougemont, Uniform definability on finite structures with successor, in: SIGACT'84, 1984, pp. 409-417.
16. H.D. Ebbinghaus, J. Flum, Finite Model Theory, in: Perspect. Math. Logic, Springer-Verlag, 1995.
17. J. Ellis-Monaghan, New results for the Martin polynomial, J. Combin. Theory Ser. B 74 (1998) 326-351
18. S. Even, Graph Algorithms, Pitman, London, 1979.
19. E.J. Farrell, An introduction to matching polynomials, J. Combin. Theory Ser. B 27 (1979) 75-86.
20. E.J. Farrell, On a general class of graph polynomials, J. Combin. Theory Ser. B 26 (1979) 111-122.
21. D.C. Fisher, A.E. Solow, Dependence polynomials, Discrete Math. 82 (1990) 251-258.
22. I. Gutman, F. Harary, Generalizations of the matching polynomial, Utilitas Math. 24 (1983) 97-106.
23. M.G. Garey, D.S. Johnson, Computers and Intractability, in: Mathematical Series, Freeman, 1979.
24. M. Grohe, J. Mariño, Definability and descriptive complexity on databases of bounded tree-width, in: C. Beeri, P. Bunemann (Eds.), Database Theory, ICDT'99, in: Lecture Notes in Comput. Sci., Vol. 1540, Springer-Verlag, 1999, pp. 70-82.
25. C.D. Godsil, On the theory of the matching polynomial, J. Graph Theory 5 (1981) 137-144.
26. C.D. Godsil, Algebraic Combinatorics, Chapman and Hall, 1993.
27. C. Hoede, X. Li, Clique polynomials and independent set polynomials of graphs, Discrete Math. 125 (1994) 219-228.
28. L. Lovasz, M. Plummer, Matching Theory, North-Holland, 1986.
29. J.A. Makowsky, Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width, Discrete Appl. Math., to appear.
30. J.A. Makowsky, Model theory and computer science: An appetizer, Chapter 1.6, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook Logic Comput. Sci., Vol. 1, Oxford Univ. Press, Oxford, 1992.
31. J.A. Makowsky, Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width, in: Proceedings of the 12th Symposium on Discrete Algorithms, SIAM, 2001, pp. 487-495.
32. J.A. Makowsky, J.P. Marino, The parametrized complexity of Knot polynomials, J. Comput. System Sci., to appear.
33. S.D. Noble, Complexity of graph polynomials, PhD thesis, New College, Oxford University, England, 1997.
34. S.D. Noble, Evaluating the Tutte polynomial for graphs of bounded tree-width, Combin. Probab. Comput. 7 (1998) 307-321.
35. C. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
36. K.R. Parthasarathy, Graph characterizing polynomials, Discrete Math. 206 (1999) 171-178.
37. J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958.
38. H. Sachs, Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom, Publ. Math. Debrecen. 11 (1964) 119-134.
39. R.P. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth and Brooks, 1986.
40. L.G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.
41. M. Las Vergnas, Le polynôme de Martin d'un graphe eulerien, Ann. Discrete Math. 17 (1983) 397-411.
42. D.J.A. Welsh, Complexity: Knots, Colourings and Counting, in: London Math. Soc. Lecture Notes Ser, Vol. 186, Cambridge Univ. Press, Cambridge, 1993.
43. H.S. Wilf, generatingfunctionology, Academic Press, 1990.