Connection Matrices for MSOL-Definable Structural Invariants
From MaRDI portal
Publication:3601800
DOI10.1007/978-3-540-92701-3_4zbMath1209.03025OpenAlexW1532397462MaRDI QIDQ3601800
Publication date: 12 February 2009
Published in: Logic and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92701-3_4
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Logic in computer science (03B70)
Cites Work
- Algorithmic uses of the Feferman-Vaught theorem
- The interlace polynomial of a graph
- 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
- Efficient approximation of convex recolorings
- On the Harmonious Coloring of Graphs
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Graph coloring with no large monochromatic components
- On Counting Generalized Colorings
- Edge coloring models and reflection positivity
- Hard Enumeration Problems in Geometry and Combinatorics
- Evaluations of Graph Polynomials
- Graph-Theoretic Concepts in Computer Science
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
