Pages that link to "Item:Q881587"
From MaRDI portal
The following pages link to Achievable sets, brambles, and sparse treewidth obstructions (Q881587):
Displaying 9 items.
- The treewidth of line graphs (Q723884) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- On the treewidth of toroidal grids (Q897618) (← links)
- Systematic and deterministic graph minor embedding for Cartesian products of graphs (Q1679291) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- Treewidth and gonality of glued grid graphs (Q2181210) (← links)
- On the gonality of Cartesian products of graphs (Q2223444) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
