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.
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- FPT algorithms for generalized feedback vertex set problems (Q2110739) (← links)
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- Verifying graph programs with monadic second-order logic (Q2117269) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width (Q2121810) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- A pebbling comonad for finite rank and variable logic, and an application to the equirank-variable homomorphism preservation theorem (Q2133477) (← links)
- Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
- Finding all leftmost separators of size \(\le k\) (Q2149878) (← links)
- A general framework for path convexities (Q2156285) (← links)
- Second-order finite automata (Q2158302) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- The tree-width of C (Q2174562) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Bundled crossings revisited (Q2206831) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- An improvement of Reed's treewidth approximation (Q2232243) (← links)
- Waypoint routing on bounded treewidth graphs (Q2234792) (← links)
- Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules (Q2234797) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- On the complexity of the identifiable subgraph problem (Q2255039) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- Treewidth, crushing and hyperbolic volume (Q2279065) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Whither semantics? (Q2286732) (← links)