From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials

  • J. A. Makowsky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)


We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generalizations of the Tutte polynomial, matching polynomials, interlace polynomials, and the cover polynomial of digraphs. We introduce the class of (hyper)graph polynomials definable in second order logic, and outline a research program for their classification in terms of definability and complexity considerations, and various notions of reducibilities.


Polynomial Time Order Logic Graph Property Recursion Scheme Descriptive Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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)CrossRefGoogle Scholar
  2. 2.
    Aigner, M., van der Holst, H.: Interlace polynomials. Linear Algebra and Applications 377, 11–30 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12, 125–134 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Andrzejak, A.: An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discrete Mathematics 190, 39–54 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Arratia, R., Bollobás, B., Sorkin, G.B.: The interlace polynomial: a new graph polynomial. Journal of Combinatorial Theory, Series B 92, 199–233 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Arratia, R., Bollobás, B., Sorkin, G.B.: A two-variable interlace polynomial. Combinatorica 24(4), 567–584 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Birkhoff, G.D.: A determinant formula for the number of ways of coloring a map. Annals of Mathematics 14, 42–46 (1912)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Bläser, M., Makowsky, J.A.: Where is computing the colored Tutte polynomial hard? (in preparation, 2006)Google Scholar
  9. 9.
    Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)CrossRefzbMATHGoogle Scholar
  10. 10.
    Bollobás, B.: Modern Graph Theory. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  11. 11.
    Bollobás, B., Riordan, O.: A Tutte polynomial for coloured graphs. Combinatorics, Probability and Computing 8, 45–94 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Bürgisser, P.: Completeness and Reduction in Algebraic Complexity. Algorithms and Computation in Mathematics, vol. 7. Springer, Heidelberg (2000)CrossRefzbMATHGoogle Scholar
  13. 13.
    Chow, T.Y.: The path-cycle symmetric function of a digraph. Advances in Mathematics 118, 71–98 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Chung, F.R.K., Graham, R.L.: On the cover polynomial of a digraph. Journal of Combinatorial Theory, Ser. B 65(2), 273–290 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Courcelle, B., Makowsky, J.A.: Recursive definitions of graph polynomials (in preparation, 2006)Google Scholar
  16. 16.
    Courcelle, B.: The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues. Informatique Théorique 26, 257–286 (1992)zbMATHGoogle Scholar
  17. 17.
    Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Johann Ambrosius Barth, 3rd edn. (1995)Google Scholar
  18. 18.
    Dong, F.M., Koh, K.M., Teo, K.L.: Chromatic Polynomials and Chromaticity of Graphs. World Scientific, Singapore (2005)CrossRefzbMATHGoogle Scholar
  19. 19.
    Downey, R.G., Fellows, M.F.: Parametrized Complexity. Springer, Heidelberg (1999)CrossRefzbMATHGoogle Scholar
  20. 20.
    Ebbinghaus, H.D., Flum, J.: Finite Model Theory. In: Perspectives in Mathematical Logic. Springer, Heidelberg (1995)Google Scholar
  21. 21.
    Farr, G.E.: The Go polynomials of a graph. Theoretical Computer Science 306, 1–18 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Farrell, E.J.: On a general class of graph polynomials. Journal of Combinatorial Theory, Series B 26, 111–122 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Gessel, I.: Generalized rook polynomials and orthogonal polynomials. In: IMA. Mathematics and Its Applications, vol. 18, pp. 159–176. Springer, Heidelberg (1989)Google Scholar
  24. 24.
    Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2001)CrossRefzbMATHGoogle Scholar
  25. 25.
    Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall, Boca Raton (1993)zbMATHGoogle Scholar
  26. 26.
    Grädel, E., Gurevich, Y.: Metafinite model theory. Information and Computation 140, 26–81 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Hodges, W.: Model Theory. Encyclopedia of Mathematics and its Applications, vol. 42. Cambridge University Press, Cambridge (1993)CrossRefzbMATHGoogle Scholar
  28. 28.
    Immerman, N.: Descriptive Complexity. In: Graduate Texts in Computer Science. Springer, Heidelberg (1999)Google Scholar
  29. 29.
    Jaeger, F.: Tutte polynomials and link polynomials. Proceedings of the American Mathematical Society 103, 647–654 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  30. 30.
    Jaeger, F., Vertigan, D.L., Welsh, D.J.A.: On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Camb. Phil. Soc. 108, 35–53 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Kauffman, L.H.: A Tutte polynomial for signed graphs. Discrete Applied Mathematics 25, 105–127 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Lavrov, I.A.: Effective inseparability of the set of identically true formulas and the set of formulas with finite counterexamples for certain elementary theories (in russian). Algebra i Logika 2, 5–18 (1962)MathSciNetGoogle Scholar
  33. 33.
    Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)CrossRefzbMATHGoogle Scholar
  34. 34.
    Lotz, M., Makowsky, J.A.: On the algebraic complexity of some families of coloured Tutte polynomials. Advances in Applied Mathematics 32(1–2), 327–349 (2003)MathSciNetzbMATHGoogle Scholar
  35. 35.
    Lovasz, L., Plummer, M.: Matching Theory. North Holland, Amsterdam (1986)zbMATHGoogle Scholar
  36. 36.
    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, Philadelphia (2001)Google Scholar
  37. 37.
    Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126, 1–3 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  38. 38.
    Makowsky, J.A.: Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width. Disc. Appl. Math. 145(2), 276–290 (2005)CrossRefzbMATHGoogle Scholar
  39. 39.
    Makowsky, J.A., Mariño, J.P.: Farrell polynomials on graphs of bounded treewidth. Advances in Applied Mathematics 30, 160–176 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  40. 40.
    Makowsky, J.A., Mariño, J.P.: The parametrized complexity of knot polynomials. Journal of Computer and System Sciences 64(4), 742–756 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  41. 41.
    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: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 399–410. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  42. 42.
    Makowsky, J.A., Rotics, U.: Computing the chromatic polynomial on graphs of bounded clique-width (preprint, 2006)Google Scholar
  43. 43.
    Noble, S.D.: Evaluating the Tutte polynomial for graphs of bounded tree-width. Combinatorics, Probability and Computing 7, 307–321 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  44. 44.
    Oum, S.: Approximating rank-width and clique-width quickly. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 49–58. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  45. 45.
    Oxley, J.G., Welsh, D.J.A.: Tutte polynomials computable in polynomial time. Discrete Mathematics 109, 185–192 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  46. 46.
    Pitteloud, P.: Chromatic polynomials and the symmetric group. Graphs and Combinatorics 20, 131–144 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  47. 47.
    Riordan, J.: An Introduction to Combinatorial Analysis. Wiley, Chichester (1958)zbMATHGoogle Scholar
  48. 48.
    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)Google Scholar
  49. 49.
    Stanley, R.P.: Acyclic orientations of graphs. Discrete Mathematics 5, 171–178 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  50. 50.
    Stanley, R.P.: A symmetric function generalization of the chromatic polynomial of a graph. Advances in Mathematics 111, 166–194 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  51. 51.
    Sylvester, J.J.: On an application of the new atomic theory to the graphical presentation of the invariants and covariants of binary quantics, with three appendices. American Journal of Mathematics 1, 161–228 (1878)Google Scholar
  52. 52.
    Taitslin, M.A.: Effective inseparability of the sets of identically true and finitely refutable formulae of elementary lattice theory (in Russian). Algebra i Logika 1, 24–38 (1961)Google Scholar
  53. 53.
    Trinajstić, N.: Chemical Graph Theory, 2nd edn. CRC Press, Boca Raton (1992)Google Scholar
  54. 54.
    Tutte, W.T.: Graph-Polynomials. Advances in Applied Mathematics 32, 5–9 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  55. 55.
    Tuza, Z.: Graph colorings with local constraints – a survey. Discussiones Mathematicae - Graph Theory 17(2), 161–228 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  56. 56.
    Valiant, L.G.: Completeness classes in algebra. In: Proceedings of 11th STOC, pp. 249–261 (1979)Google Scholar
  57. 57.
    Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8(3), 410–421 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  58. 58.
    Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Notes Series, vol. 186. Cambridge University Press, Cambridge (1993)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • J. A. Makowsky
    • 1
  1. 1.Department of Computer ScienceTechnion–Israel Institute of TechnologyHaifaIsrael

Personalised recommendations