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.
- Between treewidth and clique-width (Q300479) (← links)
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry (Q306575) (← links)
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Planar disjoint-paths completion (Q329285) (← links)
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Tree-width of hypergraphs and surface duality (Q414640) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Distance three labelings of trees (Q415278) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Decomposition width of matroids (Q415290) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- On the path-width of integer linear programming (Q515665) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- On rules with existential variables: walking the decidability line (Q646515) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)