Pages that link to "Item:Q2071824"
From MaRDI portal
The following pages link to Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824):
Displaying 6 items.
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
- Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)
