Evaluations of graph polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5344 LNCS, Issue , 2008, Pages 183-194

  Godlin, Benny ^a   Kotek, Tomer ^a   Makowsky, Johann A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTERS; FORMAL LOGIC; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TECHNICAL PRESENTATIONS;

CONNECTION MATRIXES; GRAPH PARAMETERS; GRAPH POLYNOMIALS; MAXIMAL CLIQUES; MODULAR COUNTING; OF GRAPHS; SUFFICIENT CONDITIONS; TUTTE POLYNOMIALS; UNDERLYING GRAPHS;

COMPUTATIONAL GEOMETRY;

EID: 58349106776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92248-3_17     Document Type: Conference Paper

References (16)

1. Arratia, R., Bollobás, B., Sorkin, G.B.: The interlace polynomial of a graph. Journal of Combinatorial Theory, Series B 92, 199-233 (2004)
2. Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)
3. Bollobás, B.: Modern Graph Theory. Springer, Heidelberg (1999)
4. Courcelle, B., Olariu, S.: Upper bounds to the clique-width of graphs. Discrete Applied Mathematics 101, 77-114 (2000)
5. Courcelle, B.: A multivariate interlace polynomial and its computation for graphs of bouded clique-width. Electronic Journal of Combinatorics 15(1), R69 (2008)
6. Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1996)
7. Edwards, K., McDiarmid, C.: The complexity of harmonious colouring for trees. Discrete Appl. Math. 57(2-3), 133-144 (1995)
8. Freedman, M., Lovász, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphisms of graphs. Journal of AMS 20, 37-51 (2007)
9. Goodall, A.J.: Some new evaluations of the Tutte polynomial. Journal of Combinatorial Theory, Series B 96, 207-224 (2006)
10. Goodall, A.J.: Parity, eulerian subgraphs and the Tutte polynomial. Journal of Combinatorial Theory, Series B 98(3), 599-628 (2008)
11. Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2001)
12. Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126(1-3), 159-213 (2004)
13. Makowsky, J.A.: Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width. Disc. Appl. Math. 145(2), 276-290 (2005)
14. Makowsky, J.A.: From a zoo to a zoology: Towards a general theory of graph polynomials. Theory of Computing Systems (July 2007), http://dx.doi.org/ 10.1017/s00224-007-9022-9
15. Makowsky, J.A., Zilber, B.: Polynomial invariants of graphs and totally categorical theories. MODNET Preprint No. 21 (2006), http://www.logique.jussieu. fr/modnet/Publications/Preprint%20server
16. Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Notes Series, vol. 186. Cambridge University Press, Cambridge (1993)