Evaluations of Graph Polynomials
From MaRDI portal
Publication:5302054
DOI10.1007/978-3-540-92248-3_17zbMath1202.05065OpenAlexW1606469315MaRDI QIDQ5302054
Benny Godlin, Johann A. Makowsky, Tomer Kotek
Publication date: 20 January 2009
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_17
Tutte polynomialgraph parametergraph polynomialsinterlace polynomialmonadic second order logicconnection matrix
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Logics of Finite Hankel Rank ⋮ Harmonious colourings of graphs ⋮ A logician's view of graph polynomials ⋮ Connection Matrices for MSOL-Definable Structural Invariants ⋮ Recurrence relations for graph polynomials on bi-iterative families of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic uses of the Feferman-Vaught theorem
- The interlace polynomial of a graph
- A multivariate interlace polynomial and its computation for graphs of bounded clique-width
- The complexity of harmonious colouring for trees
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Upper bounds to the clique width of graphs
- Parity, Eulerian subgraphs and the Tutte polynomial
- Some new evaluations of the Tutte polynomial
- Reflection positivity, rank connectivity, and homomorphism of graphs
This page was built for publication: Evaluations of Graph Polynomials
