Pages that link to "Item:Q3146251"

The following pages link to Fusion in relational structures and the verification of monadic second-order properties (Q3146251):

Displaying 14 items.

• Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
• The parametrized complexity of knot polynomials (Q1877705) (← links)
• The rank-width of edge-coloured graphs (Q2392245) (← links)
• Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
• Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
• $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
• Simple monadic theories and partition width (Q3170562) (← links)
• Graphs as relational structures: An algebraic and logical approach (Q4037312) (← links)
• Multi-clique-width (Q4638063) (← links)
• GETGRATS (Q4923529) (← links)
• Effective optimization with weighted automata on decomposable trees (Q5413875) (← links)
• Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)