The following pages link to (Q4407447):
Displaying 6 items.
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- The bivariate Ising polynomial of a graph (Q967288) (← links)
- On tree-partition-width (Q1024321) (← links)
