Pages that link to "Item:Q3077955"
From MaRDI portal
The following pages link to Graph structure and monadic second-order logic. A language-theoretic approach (Q3077955):
Displaying 32 items.
- Towards compositional graph theory (Q5971395) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Seurat games on Stockmeyer graphs (Q6056811) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- On the algebraization of Henkin‐type second‐order logic (Q6094141) (← links)
- Unfoldings and Coverings of Weighted Graphs (Q6094515) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)
- A meta-theorem for distributed certification (Q6182681) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs (Q6201337) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
- Counting kernels in directed graphs with arbitrary orientations (Q6559392) (← links)
- Regular planar monoidal languages (Q6561334) (← links)
- Generalisations of matrix partitions: complexity and obstructions (Q6564025) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)
- A reasoning system for satisfiability of diagrammatic specifications (Q6599622) (← links)
- Strong backdoors for default logic (Q6610193) (← links)
- Monadic monadic second order logic (Q6612795) (← links)
- On the power of local graph expansion grammars with and without additional restrictions (Q6614008) (← links)
- MSO undecidability for hereditary classes of unbounded clique-width (Q6614399) (← links)
- A logical approach to graph databases (Q6615562) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)
- Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
- Preservation theorems for Tarski's relation algebra (Q6635502) (← links)
- Extensions and limits of the Specker-Blatter theorem (Q6642890) (← links)
- Transducers of polynomial growth (Q6649429) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
- The complexity of the perfect matching-cut problem (Q6667583) (← links)
