The following pages link to (Q3684139):
Displaying 47 items.
- Confronting intractability via parameters (Q465686) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Excluding a large theta graph (Q723880) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- Three ways to cover a graph (Q898135) (← links)
- Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- Nonconstructive advances in polynomial-time complexity (Q1098635) (← links)
- Tree-decompositions, tree-representability and chordal graphs (Q1104938) (← links)
- Constructive complexity (Q1182305) (← links)
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width (Q1322236) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- The structure of obstructions to treewidth and pathwidth (Q1613365) (← links)
- A Kuratowski theorem for nonorientable surfaces (Q1821111) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Ordered colourings (Q1896351) (← links)
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait (Q2171018) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- Properties of vertex cover obstructions (Q2455575) (← links)
- Unifying tree decompositions for reasoning in graphical models (Q2457660) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Lift-contractions (Q2509756) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Subgraphs and well‐quasi‐ordering (Q4020706) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- (Q4352949) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results (Q4845143) (← links)
- Testing superperfection of k-trees (Q5056149) (← links)
- On the complexity of graph embeddings (Q5060116) (← links)
- The length of an intersection (Q5108104) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- Finding Minors in Graphs with a Given Path Structure (Q5251199) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- (Q5463581) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
