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.
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- Parameterized modal satisfiability (Q1759682) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Querying linguistic treebanks with monadic second-order logic in linear time (Q1770837) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Arity and alternation in second-order logic (Q1919768) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- The computational complexity of the parallel knock-out problem (Q2481963) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Recognizability of graph and pattern languages (Q2491214) (← links)
- Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- Graph decompositions for cartesian products (Q3439368) (← links)