Pages that link to "Item:Q5710824"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710824):
Displaying 5 items.
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Graph searching and a min-max theorem for tree-width (Q1325271) (← links)
- Obtaining Optimal<i>k</i>-Cardinality Trees Fast (Q5233508) (← links)