The following pages link to (Q6065417):
Displaying 4 items.
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)