From a zoo to a zoology: Towards a general theory of graph polynomials

Theory of Computing Systems

Volumn 43, Issue 3-4, 2008, Pages 542-562

  Makowsky, J A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Combinatorial counting functions; Descriptive complexity; Graph polynomials

Indexed keywords

CHROMATIC POLYNOMIALS; COUNTING FUNCTIONS; DESCRIPTIVE COMPLEXITY; GRAPH POLYNOMIALS; MATCHING POLYNOMIAL; RESEARCH PROGRAMS; SECOND-ORDER LOGIC; TUTTE POLYNOMIAL;

GRAPH THEORY;

POLYNOMIALS;

EID: 44649108790     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9022-9     Document Type: Article

References (84)

1. Aigner, M.: The Penrose polynomial of graphs and matroids. In: Surveys in Combinatorics, 2001 (Sussex). London Mathematical Society Lecture Note Series, vol. 288, pp. 11-46. Cambridge University Press, Cambridge (2001)
2. M. Aigner H. van der Holst 2004 Interlace polynomials Linear Algebra Appl. 377 11 30
3. N. Alon M. Tarsi 1992 Colorings and orientations of graphs Combinatorica 12 125 134
4. A. Andrzejak 1998 An algorithm for the Tutte polynomials of graphs of bounded treewidth Discret. Math. 190 39 54
5. R. Arratia B. Bollobás G.B. Sorkin 2004 The interlace polynomial: a new graph polynomial J. Comb. Theory Ser. B 92 199 233
6. R. Arratia B. Bollobás G.B. Sorkin 2004 A two-variable interlace polynomial Combinatorica 24 4 567 584
7. Averbouch, I., Makowsky, J.A.: The complexity of multivariate matching polynomials. Preprint (January 2007). Available at www.cs.technion.ac.il/ admlogic/TR/readme.html
8. D. Babić A. Graovac B. Mohar T. Pisanski 1986 The matching polynomial of a polygraph Discret. Appl. Math. 15 11 24
9. G.D. Birkhoff 1912 A determinant formula for the number of ways of coloring a map Ann. Math. 14 42 46
10. Bläser, M., Dell, H.: Complexity of the cover polynomial. In: Proceedings of ICALP 2007. Lecture Notes in Computer Science. Springer (2007, to appear)
11. Bläser, M., Dell, H., Makowsky, J.A.: Algebraic reductions for evaluations of the colored Tutte polynomial. Preprint (January 2007). Available at www.cs.technion.ac.il/admlogic/TR/readme.html
12. L. Blum M. Shub S. Smale 1989 On a theory of computation and complexity over the real numbers Bull. Am. Math. Soc. 21 1 46
13. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (1998)
14. Bollobás, B.: Modern Graph Theory. Springer, New York (1999)
15. B. Bollobás O. Riordan 1999 A Tutte polynomial for coloured graphs Comb. Probab. Comput. 8 45 94
16. P. Bürgisser 1999 On the structure of Valiant's complexity classes Discret. Math. Theoret. Comput. Sci. 3 73 94
17. Bürgisser, P.: Completeness and Reduction in Algebraic Complexity Theory. Algorithms and Computations in Mathematics, vol. 7. Springer, New York (2000)
18. T.Y. Chow 1996 The path-cycle symmetric function of a digraph Adv. Math. 118 71 98
19. F.R.K. Chung R.L. Graham 1995 On the cover polynomial of a digraph J. Comb. Theory Ser. B 65 2 273 290
20. B. Courcelle 1992 The monadic second-order logic of graphs III: treewidth, forbidden minors and complexity issues Inf. Theor. 26 257 286
21. Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1, pp. 313-400. World Scientific, Singapore (1997), Chapter 5
22. Courcelle, B.: A multivariate interlace polynomial. Preprint arXiv cs/0702016 (January 2007). Available at http://front.math.ucdavis.edu/0702.6016
23. Courcelle, B., Makowsky, J.A.: Recursive definitions of graph polynomials. Draft manuscript (2006)
24. B. Courcelle J.A. Makowsky U. Rotics 2001 On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic Discret. Appl. Math. 108 1-2 23 52
25. Courcelle, B., Godlin, B., Makowsky, J.A.: Towards a theory of graph polynomials, I: second order definable polynomials (2007, in preparation)
26. Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs, 3rd edn. Johann Ambrosius Barth (1995)
27. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B. Elsevier, Amsterdam (1990), Chapter 6
28. Dong, F.M., Koh, K.M., Teo, K.L.: Chromatic Polynomials and Chromaticity of Graphs. World Scientific, Singapore (2005)
29. Downey, R.G., Fellows, M.F.: Parametrized Complexity. Springer, New York (1999)
30. M. Dyer C. Greenhill 2000 The complexity of counting graph homomorphisms Random Struct. Algorithms 17 3-4 260 289
31. Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, New York (1995)
32. J. Ellis-Monaghan 1998 New results for the Martin polynomial J. Comb. Theory Ser. B 74 326 352
33. G.E. Farr 2003 The Go polynomials of a graph Theor. Comput. Sci. 306 1 18
34. E.J. Farrell 1979 On a general class of graph polynomials J. Comb. Theory Ser. B 26 111 122
35. D.C. Fisher A.E. Solow 1990 Dependence polynomials Discret. Math. 82 251 258
36. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York (2006)
37. Gessel, I.: Generalized rook polynomials and orthogonal polynomials. In: IMA Volumes in Mathematics and Its Applications, vol. 18, pp. 159-176. Springer, New York (1989)
38. Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, New York (2001)
39. Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall, London (1993)
40. E. Grädel Y. Gurevich 1998 Metafinite model theory Inf. Comput. 140 26 81
41. Hodges, W.: Model Theory. Encyclopedia of Mathematics and Its Applications, vol. 42. Cambridge University Press, Cambridge (1993)
42. C. Hoede X. Li 1994 Clique polynomials and independent set polynomials of graphs Discret. Math. 125 219 228
43. Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, New York (1999)
44. F. Jaeger 1988 Tutte polynomials and link polynomials Proc. Am. Math. Soc. 103 647 654
45. F. Jaeger D.L. Vertigan D.J.A. Welsh 1990 On the computational complexity of the Jones and Tutte polynomials Math. Proc. Camb. Philos. Soc. 108 35 53
46. Johnson, D.S.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. 1. Elsevier, Amsterdam (1990), Chapter 2
47. L.H. Kauffman 1989 A Tutte polynomial for signed graphs Discret. Appl. Math. 25 105 127
48. I.A. Lavrov 1962 Effective inseparability of the set of identically true formulas and the set of formulas with finite counterexamples for certain elementary theories Algebra i Logika 2 5 18 (in Russian)
49. Libkin, L.: Elements of Finite Model Theory. Springer, New York (2004)
50. M. Linial 1986 Hard enumeration problems in geometry and combinatorics SIAM J. Algebr. Discret. Methods 7 331 335
51. M. Lotz J.A. Makowsky 2004 On the algebraic complexity of some families of coloured Tutte polynomials Adv. Appl. Math. 32 1-2 327 349
52. Lovasz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol. 29. North-Holland, Amsterdam (1986)
53. Makowsky, J.A.: Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width. In: Proceedings of the 12th Symposium on Discrete Algorithms, pp. 487-495. SIAM (2001)
54. J.A. Makowsky 2004 Algorithmic uses of the Feferman-Vaught theorem Ann. Pure Appl. Log. 126 1 3
55. J.A. Makowsky 2005 Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width Discret. Appl. Math. 145 2 276 290
56. Makowsky, J.A.: From a zoo to a zoology: descriptive complexity for graph polynomials. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, July 2006. Lecture Notes in Computer Science, vol. 3988, pp. 330-341. Springer, New York (2006)
57. J.A. Makowsky J.P. Mariño 2003 Farrell polynomials on graphs of bounded treewidth Adv. Appl. Math. 30 160 176
58. J.A. Makowsky J.P. Mariño 2003 The parametrized complexity of knot polynomials J. Comput. Syst. Sci. 64 4 742 756
59. Makowsky, J.A., Meer, K.: On the complexity of combinatorial and metafinite generating functions of graph properties in the computational model of Blum, Shub and Smale. In: CSL'00. Lecture Notes in Computer Science, vol. 1862, pp. 399-410. Springer, New York (2000)
60. Makowsky, J.A., Zilber, B.: Polynomial invariants of graphs and totally categorical theories. MODNET Preprint no. 21 (2006). Available at http://www.logique.jussieu.fr/modnet/Home/index.hph
61. Makowsky, J.A., Rotics, U., Averbouch, I., Godlin, B.: Computing graph polynomials on graphs of bounded clique-width. In: Fomin, F.V. (ed.) Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers. Lecture Notes in Computer Science, vol. 4271, pp. 191-204. Springer, New York (2006)
62. K. Meer 2000 Counting problems over the reals Theor. Comput. Sci. 242 1-2 41 58
63. S.D. Noble 1998 Evaluating the Tutte polynomial for graphs of bounded tree-width Comb. Probab. Comput. 7 307 321
64. Otto, M.: Bounded Variable Logics and Counting-A Study in Finite Models, vol. 9. Springer, New York (1997), IX+183 pages
65. Oum, S.: Approximating rank-width and clique-width quickly. In: Graph Theoretic Concepts in Computer Science, WG 2005. Lecture Notes in Computer Science, vol. 3787, pp. 49-58 (2005)
66. J.G. Oxley D.J.A. Welsh 1992 Tutte polynomials computable in polynomial time Discret. Math. 109 185 192
67. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
68. J. Petersen 1891 Die Theorie der regulären Graphen Acta Math. 15 193 220
69. P. Pitteloud 2004 Chromatic polynomials and the symmetric group Graphs Comb. 20 131 144
70. Riordan, J.: An Introduction to Combinatorial Analysis. Wiley, New York (1958)
71. Sokal, A.: The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In: Survey in Combinatorics, 2005. London Mathematical Society Lecture Notes, vol. 327, pp. 173-226 (2005)
72. R.P. Stanley 1973 Acyclic orientations of graphs Discret. Math. 5 171 178
73. R.P. Stanley 1995 A symmetric function generalization of the chromatic polynomial of a graph Adv. Math. 111 166 194
74. J.J. Sylvester 1878 On an application of the new atomic theory to the graphical presentation of the invariants and covariants of binary quantics, with three appendices Am. J. Math. 1 161 228
75. M.A. Taitslin 1961 Effective inseparability of the sets of identically true and finitely refutable formulae of elementary lattice theory Algebra i Logika 1 24 38 (in Russian)
76. S. Toda 1991 PP is as hard as the polynomial-time hierarchy SIAM J. Comput. 21 2 865 877
77. Trinajstić, N.: Chemical Graph Theory, 2nd edn. CRC Press, Boca Raton (1992)
78. W.T. Tutte 2004 Graph-polynomials Adv. Appl. Math. 32 5 9
79. Z. Tuza 1997 Graph colorings with local constraints-a survey Discuss. Math.-Graph Theory 17.2 161 228
80. Valiant, L.: Reducibility by algebraic projections. In: Logic and Arithmetic: An International Symposium held in honour of Ernst Specker. L'enseignement Mathématique, vol. 30, pp. 365-380. Université de Genève (1982)
81. Valiant, L.G.: Completeness classes in algebra. In: Proceedings of 11th STOC, pp. 249-261 (1979)
82. L.G. Valiant 1979 The complexity of enumeration and reliability problems SIAM J. Comput. 8 3 410 421
83. Voloshin, V.I.: Coloring Mixed Hypergraphs: Theory, Algorithms and Applications. Fields Institute Monographs, vol. 17. American Mathematical Society (2002)
84. Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Notes Series, vol. 186. Cambridge University Press, Cambridge (1993)