The following pages link to (Q4246749):
Displayed 4 items.
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)