Pages that link to "Item:Q2366278"
From MaRDI portal
The following pages link to Handle-rewriting hypergraph grammars (Q2366278):
Displaying 50 items.
- Clique-width of path powers (Q266933) (← links)
- Tree-depth and vertex-minors (Q281932) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- A new graph construction of unbounded clique-width (Q509276) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Well-quasi-order of relabel functions (Q603891) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- On prime inductive classes of graphs (Q648987) (← links)
- Graph grammars with string-regulated rewriting (Q652154) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Algorithms for some graph theoretical optimization problems (abstract of thesis) (Q862821) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Order independent NCE grammars recognized in polynomial time (Q1182091) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Clique-width of partner-limited graphs (Q1422439) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
