Pages that link to "Item:Q1874383"

The following pages link to The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383):

Displaying 17 items.

• Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Circle graphs and monadic second-order logic (Q946577) (← links)
• A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
• Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
• Meta-kernelization using well-structured modulators (Q2413976) (← links)
• Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
• Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
• The recognizability of sets of graphs is a robust property (Q2566292) (← links)
• The Descriptive Complexity of Parity Games (Q3540190) (← links)
• GETGRATS (Q4923529) (← links)
• Graph Operations, Graph Transformations and Monadic Second-Order Logic: (Q4923534) (← links)