The following pages link to (Q5009468):
Displaying 6 items.
- A new approach on locally checkable problems (Q2127611) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
