An extension of the bivariate chromatic polynomial

European Journal of Combinatorics

Volumn 31, Issue 1, 2010, Pages 1-17

  Averbouch, Ilia ^a   Godlin, Benny ^a   Makowsky, J A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350095935     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2009.05.006     Document Type: Article

References (38)

1. I. Averbouch, B. Godlin, J.A. Makowsky, The most general edge elimination polynomial, arXiv: http://uk.arxiv.org/pdf/0712.3112.pdf, 2007
2. Averbouch I., Godlin B., and Makowsky J.A. A most general edge elimination polynomial. WG'08. Lecture Notes in Computer Science vol. 5344 (2008) 31-42
3. I. Averbouch, J.A. Makowsky, The complexity of multivariate matching polynomials, January 2007. Preprint
4. Biggs N. Algebraic Graph Theory. 2nd ed. (1993), Cambridge University Press
5. Bläser M., and Dell H. Complexity of the cover polynomial. In: Arge L., Cachin C., Jurdziński T., and Tarlecki A. (Eds). Automata, Languages and Programming, ICALP 2007. Lecture Notes in Computer Science vol. 4596 (2007), Springer 801-812
6. Bläser M., Dell H., and Makowsky J.A. Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions. In: Hirsch E.A., Razborov A.A., Semenov A., and Slissenko A. (Eds). Computer Science-Theory and Applications, Third International Computer Science Symposium in Russia. Lecture Notes in Computer Science vol. 5010 (2008), Springer 86-98
7. Markus Bläser, Christian Hoffmann, On the complexity of the interlace polynomial, in: STACS, vol. 08001, Dagstuhl Seminar Proceedings, pp. 97-108. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2008
8. Bollobás B. Modern Graph Theory (1999), Springer
9. Bollobás B., and Riordan O. A Tutte polynomial for coloured graphs. Combinatorics, Probability and Computing 8 (1999) 45-94
10. Courcelle B., and Olariu S. Upper bounds to the clique-width of graphs. Discrete Applied Mathematics 101 (2000) 77-114
11. Dohmen K., Pönitz A., and Tittmann P. A new two-variable generalization of the chromatic polynomial. Discrete Mathematics and Theoretical Computer Science 6 (2003) 69-90
12. Dong F.M., Hendy M.D., Teo K.L., and Little C.H.C. The vertex-cover polynomial of a graph. Discrete Mathematics 250 (2002) 71-78
13. Dong F.M., Koh K.M., and Teo K.L. Chromatic Polynomials and Chromaticity of Graphs (2005), World Scientific
14. Downey R.G., and Fellows M.F. Parametrized Complexity (1999), Springer
15. Fischer E., Makowsky J.A., and Ravve E.V. Counting truth assignments of formulas of bounded tree width and clique-width. Discrete Applied Mathematics 156 (2008) 511-529
16. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
17. F. Fomin, P. Golovach, D. Lokshtanov, S. Saurabh, Clique-width: On the price of generality, Department of Informatics, University of Bergen (Norway), 2008. Preprint
18. Freedman M., Lovász L., and Schrijver A. Reflection positivity, rank connectivity, and homomorphisms of graphs. Journal of AMS 20 (2007) 37-51
19. Giménez O., Hline ̌ný P., and Noy M. Computing the Tutte polynomial on graphs of bounded clique-width. Graph Theoretic Concepts in Computer Science, WG 2005. Lecture Notes in Computer Science vol. 3787 (2005) 59-68
20. Godsil C., and Royle G. Algebraic Graph Theory. Graduate Texts in Mathematics (2001), Springer
21. Gutman I., and Harary F. Generalizations of the matching polynomial. Utilitas Mathematicae 24 (1983) 97-106
22. Heilmann C.J., and Lieb E.H. Theory of monomer-dimer systems. Communications in Mathematical Physics 25 (1972) 190-232
23. C. Hoffmann, A most general edge elimination polynomial-thickening of edges. arXiv:0801.1600v1[math.CO], 2008
24. Jaeger F., Vertigan D.L., and Welsh D.J.A. On the computational complexity of the Jones and Tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society 108 (1990) 35-53
25. Lovász L., and Plummer M.D. Matching Theory. Annals of Discrete Mathematics vol. 29 (1986), North Holland
26. Makowsky J.A. Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126 1-3 (2004) 159-213
27. Makowsky J.A. Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width. Discrete Applied Mathematics 145 2 (2005) 276-290
28. Makowsky J.A. From a zoo to a zoology: Towards a general theory of graph polynomials. Theory of Computing Systems 43 (2008) 542-562
29. Makowsky J.A., Rotics U., Averbouch I., and 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 (2006), Springer 191-204
30. S. Noble, Evaluating a weighted graph polynomial for graphs of bounded tree-width, The Electronic Journal of Combinatorics (2009) (in press)
31. Noble S.D., and Welsh D.J.A. A weighted graph polynomial from chromatic invariants of knots. Annales de l'Institut Fourier, Grenoble 49 (1999) 1057-1087
32. Oxley J.G., Welsh D.J.A., and Murty. The Tutte polynomial and percolation. In: Bundy J.A. (Ed). Graph Theory and Related Topics (1979), Academic Press, London 329-339
33. Read R.C., and Whitehead Jr. E.G. Chromatic polynomials of homeomorphism classes of graphs. Discrete Mathematics 204 (1999) 337-356
34. Sokal A. The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. Survey in Combinatorics, 2005. London Mathematical Society Lecture Notes vol. 327 (2005) 173-226
35. Traldi L. Chain polynomials and Tutte polynomials. Discrete Mathematics 248 (2002) 279-282
36. Traldi L. On the colored Tutte polynomial of a graph of bounded tree-width. Discrete Applied Mathematics 154.6 (2006) 1032-1036
37. Yetter D.N. On graph invariants given by linear recurrence relations. Journal of Combinatorial Theory, Series B 48.1 (1990) 6-18
38. Zaslavsky T. Strong Tutte functions of matroids and graphs. Transactions of the American Mathematical Society 334 (1992) 317-347