Coloured tutte polynomials and Kauffman brackets for graphs of bounded tree width

Discrete Applied Mathematics

Volumn 145, Issue 2, 2005, Pages 276-290

  Makowsky, J A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Combinatorial enumeration; Fixed parameter complexity; Knot polynomials; Tutte polynomial

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

COMBINATORIAL ENUMERATION; FIXED PARAMETER COMPLEXITY; KNOE POLYNOMIALS; TUTTE POLYNOMIAL;

TREES (MATHEMATICS);

EID: 8344269316     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.01.016     Document Type: Article

References (66)

1. H. Andréka, J.V. Benthem, I. Németi, Modal languages and bounded fragments of predicate logic, J. Philos. Logic 27 (1998) 217-274.
2. A. Andrzejak, Splitting formulas for Tutte polynomials, J. Combin. Theory Ser. B 70 (2) (1997) 346-366.
3. A. Andrzejak, An algorithm for the Tutte polynomials of graphs of bounded treewidth, Discrete Math. 190 (1998) 39-54.
4. S. Arnborg, J. Lagergren, D. Seese, Easy problems for tree decomposable graphs, J. Algorithms 12 (1991) 308-340.
5. J. Barwise, S. Feferman (Eds.), Model-Theoretic Logics, Perspectives in Mathematical Logic, Springer, Berlin, 1985.
6. H. Bodlaender, Treewidth: Algorithmic techniques and results, in: I. Privara, P. Ruzicka (Eds.), Proceedings of the 22th International Symposium on the Mathematical Foundation of Computer Science, MFCS'97, Lecture Notes in Computer Science, vol. 1295, Springer, Berlin, 1997, pp. 29-36.
7. H. Bodlander, B. de Fluiter, Reduction algorithms for graphs of small tree width, Inform. Comput. 167 (2001) 86-119.
8. B. Bollobás, Modern Graph Theory, Springer, Berlin, 1999.
9. B. Bollobás, O. Riordan, A Tutte polynomial for coloured graphs, Combin. Probab. Comput. 8 (1999) 45-94.
10. T. Brylawski, J. Oxley, The Tutte polynomial and its applications, in: N. White (Ed.), Matroid Applications, Cambridge University Press, Cambridge, 1992, pp. 123-225.
11. P. Bürgisser, Completeness and Reduction in Algebraic Complexity, Algorithms and Computation in Mathematics, vol. 7, Springer, Berlin, 2000.
12. B. Courcelle, The monadic second-order theory of graphs I: recognizable sets of finite graphs, Inform. Comput. 85 (1990) 12-75.
13. B. Courcelle, Monadic second-order logic of graphs VII: graphs as relational structures, Theoret. Comput. Sci. 101 (1992) 3-33.
14. B. Courcelle, J.A. Makowsky, andU. 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.
15. B. Courcelle, J.A. Makowsky, Fusion on relational structures and the verification of monadic second order properties, Math. Structures Comput. Sci. 12 (2) (2002) 203-235.
16. B. Courcelle, S. Olariu, Upper bounds to the clique-width of graphs, Discrete Appl. Math. 101 (2000) 77-114.
17. B. de Fluiter, Algorithms for Graphs of Small Treewidth, Ph.D. Thesis, Department of Computer Science, University of Utrecht, 1997.
18. R. Diestel, Graph Theory, Graduate Texts in Mathematics, Springer, Berlin, 1996.
19. R.G. Downey, M.F. Fellows, Parametrized Complexity, Springer, Berlin, 1999.
20. H.D. Ebbinghaus, J. Flum, Finite Model Theory, Perspectives in Mathematical Logic, Springer, Berlin, 1995.
21. H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Undergraduate Texts in Mathematics, Springer, Berlin, 1980.
22. T. Feder, M. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction, in: STOC'93, ACM, New York, 1993, pp. 612-622.
23. S. Feferman, R. Vaught, The first order properties of algebraic systems, Fund. Math. 47 (1959) 57-103.
24. M.G. Garey, D.S. Johnson, Computers and Intractability, Mathematical Series, W.H. Freeman and Company, New York, 1979.
25. T. Grädel, C. Hirsch, M. Otto, Back and forth between guarded and modal logics, in: LiCS'2000, IEEE, New York, 2000, pp. 217-228.
26. M. Grohe, M. Frick, The complexity of first-order and monadic second-order logic revisited, in: Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS'02), IEEE, New York, 2002, pp. 215-224.
27. n,n, Lecture Notes in Computer Science, vol. 1928, 2000, pp. 196-205.
28. F. Harary, E. Palmer, Graphical Enumeration, Academic Press, New York, 1973.
29. D. Hausmann, B. Korte, Algorithmic versus axiomatic definitions of matroida, Math. Programming Study 14 (1981) 98-111.
30. P. Hliněný, Branch-width, parse trees, and monadic second order logic for matroids, preprint, 2002.
31. F. Jaeger, Tutte polynomials and link polynomials, Proc. Amer. Math. Soc. 103 (1988) 647-654.
32. F. Jaeger, D.L. Vertigan, D.J.A. Welsh, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc. 108 (1990) 35-53.
33. T. Johnson, N. Robertson, P. Seymour, R. Thomas, Directed tree-width, J. Combin. Theory Set B 81 (1) (2001) 138-154.
34. L.H. Kauffman, A Tutte polynomial for signed graphs, Discrete Appl. Math. 25 (1989) 105-127.
35. L.H. Kauffman, Knots and Physics, World Scientific, Singapore, 1991.
36. L.H. Kauffman (Ed.), Knots and Applications, World Scientific, Singapore, 1995.
37. A. Kawauchi, A Survey of Knot Theory, Birkhäuser Verlag, Basel, 1996.
38. R.E. Ladner, Application of model theoretic games to discrete linear orders and finite automata, Inform. Control 33 (1977) 281-303.
39. W.B.R. Lickorish, Polynomials for links, Bull. London Math. Soc. 20 (1988) 558-588.
40. M. Lotz, J.A. Makowsky, On the algebraic complexity of some families of coloured Tutte polynomials, Adv. Appl. Math. 32 (1-2) (2003) 327-349.
41. J.A. Makowsky, Invariant definability, Computational Logic and Proof Theory, Lecture Notes in Computer Science, vol. 1289, Springer, Berlin, 1997, pp. 186-202.
42. 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, Philadelphia, 2001, pp. 487-495.
43. J.A. Makowsky, Algorithmic uses of the Fefennan-Vaught theorem, Annals of Pure and Applied Logic, 126 (2004) 159-213.
44. J.A. Makowsky, J.P. Mariño, Farrell polynomials on graphs of bounded treewidth, Adv. Appl. Math. 30 (2003) 160-176.
45. J.A. Makowsky, J.P. Mariño, The parametrized complexity of knot polynomials, J. Comput. System Sci. 64 (4) (2003) 742-756.
46. J.A. Makowsky, K. Meer, On the complexity of combinatorial and metafinite generating functions of graph properties in the computational model of Blum, Shub and Smale, CSL'00, Lecture Notes in Computer Science, vol. 1862, Springer, Berlin, 2000, pp. 399-410.
47. J. Mighton, Knot Theory on Bipartite Graphs, Ph.D. Thesis, Department of Mathematics, University of Toronto, Toronto, Canada, 1999.
48. K. Murasugi, Jones polynomials of series-parallel knots via Alfred Lehman, Knot Theory, Dedicated to Professor Kunio Murasugi for his 70th Birthday, 2000, pp. 1-5.
49. S. Negami, Polynomial invariants of graphs, Trans. Amer. Math. Soc. 299 (1987) 601-622.
50. S.D. Noble, Complexity of graph polynomials, Ph.D. Thesis, New College, Oxford University, England, 1997.
51. S.D. Noble, Evaluating the Tutte polynomial for graphs of bounded tree-width, Combin. Probab. Comput. 7 (1998) 307-321.
52. J.G. Oxley, Matroid Theory, Oxford University Press, Oxford, 1992.
53. J.G. Oxley, D.J.A. Welsh, Tatte polynomials computable in polynomial time, Discrete Math. 109 (1992) 185-192.
54. J. Ptzytycki, Algebraic tangles, in: M. Hazewinkel (Ed.), Encyclopedia of Mathematics, Supplement in, Kluwer Academic Publisher, Dordrecht, 2002.
55. J. Przytycki, T. Tsukamoto, The fourth skein module and the Montesinos-Nakanishi conjecture for 3-algebraic links, J. Knot Theory Ramifications 10 (7) (2001) 959-982.
56. P.D. Seymour, Decomposition of regular matroids, J. Combin. Theory Ser. B 28 (1980) 305-359.
57. A. Sossinsky, Noeuds: Genèse d'une théorie mathématique, Seuil, Paris, 1999.
58. M.B. Thistlethwaite, A spanning tree expansion of the Jones polynomial, Topolgy 26 (1987) 297-309.
59. M.B. Thistlethwaite, Kauffman's polynomial and alternating links, Topolgy 27 (1988) 297-309.
60. L. Traldi, A note on the colored Tutte polynomial of a graph of bounded tree width, January 2003, preprint.
61. K. Truemper, Matroid Decomposition, Academic Press, New York, 1992.
62. W.T. Tutte, A contribution to the theory of chromatic polynomials, Canadian J. Math. 6 (1954) 80-91.
63. D.J.A. Welsh, Matroid Theory, London Mathematical Society Monographs, vol. 8, Academic Press, New York, 1976.
64. D.J.A. Welsh, Complexity: Knots, Colourings and Counting, London Mathematical Society Lecture Notes Series, vol. 186, Cambridge University Press, Cambridge, 1993.
65. D.J.A. Welsh, Randomized approximation schemes for Tutte-Grothedieck invariants, in D. Aldons et al. (Ed.), Discrete Probability and Algorithms, IMA Volumes in Mathematics and Applications, vol. 72, Springer, Berlin, 1995, pp. 133-148.
66. D.J.A. Welsh, Approximate counting, in: R.A. Bailey (Ed.), Surveys in Combinatorics, 1997, London Mathematical Society Lecture Notes Series, vol. 241, Cambridge Universiry Press, Cambridge, 1997, pp. 287-324.