The following pages link to (Q4502805):
Displaying 6 items.
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Subgraph complementation (Q2182091) (← links)
- On the Hardness of Switching to a Small Number of Edges (Q2817858) (← links)
- Switching to Hedgehog-Free Graphs Is NP-Complete (Q3010425) (← links)
- GETGRATS (Q4923529) (← links)
- Partial complementation of graphs (Q5116485) (← links)
