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.
- Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- On the width of regular classes of finite structures (Q2305404) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Cooperative games with overlapping coalitions: charting the tractability frontier (Q2321289) (← links)
- Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- On the data complexity of consistent query answering over graph databases (Q2361352) (← 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)
- Hyperfinite MV-algebras (Q2376570) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Regular queries on graph databases (Q2402613) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- On the satisfiability of quantum circuits of small treewidth (Q2411047) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- Specifying graph languages with type graphs (Q2423749) (← links)
- Recognizable series on graphs and hypergraphs (Q2424675) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← 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)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Digraphs of bounded elimination width (Q2442210) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Syntactic recognizability of graphs with fuzzy attributes (Q2445984) (← 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)