Pages that link to "Item:Q4012672"
From MaRDI portal
The following pages link to The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672):
Displaying 50 items.
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Computing square roots of graphs with low maximum degree (Q2413970) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
- Completely independent spanning trees in (partial) \(k\)-trees (Q2516669) (← links)
- The relative clique-width of a graph (Q2642017) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- Graph decompositions for cartesian products (Q3439368) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- (Q4273871) (← links)
- Automata-based Representations for Infinite Graphs (Q4331049) (← links)
- A note on the computability of graph minor obstruction sets for monadic second order ideals (Q4520519) (← links)
- Recognizability equals definability for partial k-paths (Q4572008) (← links)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
- (Q4852905) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Recognizable sets of graphs of bounded tree-width (Q5096279) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- (Q5150524) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- On the Complexity of Finding a Potential Community (Q5283357) (← links)
- Complexity of the Packing Coloring Problem for Trees (Q5302050) (← links)
- The monadic second-order logic of graphs XVI : Canonical graph decompositions (Q5310655) (← links)
- Computer Science Logic (Q5394586) (← links)
- (Q5874521) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Monoidal Width (Q6076171) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- How I got to like graph polynomials (Q6593617) (← links)
