The following pages link to (Q6089654):
Displaying 6 items.
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
- Polynomial kernels for paw-free edge modification problems (Q5919117) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)