Connection Matrices for MSOL-Definable Structural Invariants

DOI10.1007/978-3-540-92701-3_4zbMATH Open1209.03025OpenAlexW1532397462MaRDI QIDQ3601800FDOQ3601800

Authors: Johann A. Makowsky 

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

Recommendations

• Connection matrices and the definability of graph parameters
• Connection matrices and the definability of graph parameters
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 952951
• Parameterized and Exact Computation
• scientific article; zbMATH DE number 5057511
• The Connection Matrix Theory for Morse Decompositions
• Basic Constructive Connectives, Determinism and Matrix-Based Semantics
• Morse decompositions and connection matrices
• A characterization of invariant connections

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Upper bounds to the clique width of graphs
• Efficient approximation of convex recolorings
• The complexity of harmonious colouring for trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Evaluations of Graph Polynomials
• On the Harmonious Coloring of Graphs
• Edge coloring models and reflection positivity
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Title not available (Why is that?)
• The interlace polynomial of a graph
• Algorithmic uses of the Feferman-Vaught theorem
• Parity, Eulerian subgraphs and the Tutte polynomial
• Some new evaluations of the Tutte polynomial
• Hard Enumeration Problems in Geometry and Combinatorics
• Graph-Theoretic Concepts in Computer Science
• On Counting Generalized Colorings
• Connection matrices

Cited In (4)

• Finiteness conditions for graph algebras over tropical semirings
• Connection matrices and the definability of graph parameters
• Connection matrices and the definability of graph parameters
• Connection matrices

This page was built for publication: Connection Matrices for MSOL-Definable Structural Invariants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601800)