The following pages link to (Q4027169):
Displayed 11 items.
- Pancyclicity in switching classes (Q294726) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
- Subgraph complementation (Q2182091) (← links)
- Switching to Hedgehog-Free Graphs Is NP-Complete (Q3010425) (← links)
- (Q4502805) (← links)
- Partial complementation of graphs (Q5116485) (← links)
- On perfect switching classes (Q5906340) (← links)
- On perfect switching classes (Q5967036) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6163958) (← links)