Pages that link to "Item:Q2088585"
From MaRDI portal
The following pages link to On subgraph complementation to \(H\)-free Graphs (Q2088585):
Displaying 6 items.
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- On Switching to H-Free Graphs (Q3540412) (← links)
- On Switching to <i>H</i>‐Free Graphs (Q5417832) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918592) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
- Algorithms for subgraph complementation to some classes of graphs (Q6663515) (← links)