The following pages link to (Q5884490):
Displaying 5 items.
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- Compositions constrained by graph Laplacian minors (Q2855623) (← links)