Pages that link to "Item:Q598280"
From MaRDI portal
The following pages link to Algorithmic uses of the Feferman-Vaught theorem (Q598280):
Displayed 17 items.
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Why Horn formulas matter in computer science: initial structures and generic examples (Q1089797) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Game-based notions of locality over finite models (Q2478544) (← links)
- On the colored Tutte polynomial of a graph of bounded treewidth (Q2492206) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Complexity of the Bollobás-Riordan Polynomial (Q3503627) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees (Q3605529) (← links)
- A Most General Edge Elimination Polynomial (Q5302041) (← links)
- Evaluations of Graph Polynomials (Q5302054) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)