The following pages link to On perfect switching classes (Q5967036):
Displaying 5 items.
- Algorithmic aspects of switch cographs (Q906430) (← links)
- Token jumping in minor-closed classes (Q1679965) (← links)
- Switching to Hedgehog-Free Graphs Is NP-Complete (Q3010425) (← links)
- On Switching to <i>H</i>‐Free Graphs (Q5417832) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)