The following pages link to (Q3684139):
Displayed 27 items.
- 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)
- 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)
- 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)
- 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)
- Subgraphs and well‐quasi‐ordering (Q4020706) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results (Q4845143) (← links)
- (Q5463581) (← links)