The following pages link to Tree-width dichotomy (Q2136198):
Displaying 10 items.
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Computational complexity aspects of super domination (Q6076353) (← links)
- Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree (Q6144405) (← links)
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs (Q6144407) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- \(t\)-sails and sparse hereditary classes of unbounded tree-width (Q6612294) (← links)
- Treewidth, circle graphs and circular drawings (Q6630449) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
- Induced subdivisions with pinned branch vertices (Q6655694) (← links)
