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.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Tree-width of graphs without a \(3\times 3\) grid minor (Q967302) (← links)
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Treewidth and logical definability of graph products (Q1006041) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Querying linguistic treebanks with monadic second-order logic in linear time (Q1770837) (← links)
- Infinite hypergraphs. I: Basic properties (Q1814126) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- A general framework for path convexities (Q2156285) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- 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)
