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):
Displayed 50 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← 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)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Recursively indefinite databases (Q688672) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Recursive queries and context-free graph grammars (Q753477) (← 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)
- 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)
- 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)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- Upper bounds on the size of obstructions and intertwines (Q1272647) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- Monadic second-order definable text languages (Q1361884) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)