Pages that link to "Item:Q2641288"
From MaRDI portal
The following pages link to The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288):
Displaying 50 items.
- On rules with existential variables: walking the decidability line (Q646515) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- On first-order definitions of subgraph isomorphism properties (Q679970) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Complexity of secure sets (Q722534) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Recursive queries and context-free graph grammars (Q753477) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- On the definability of properties of finite graphs (Q791548) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- Directed elimination games (Q896668) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- Partitioning graphs of supply and demand (Q967306) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668) (← links)
- Complexity of conditional colorability of graphs (Q1003864) (← links)
- Treewidth and logical definability of graph products (Q1006041) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
