The following pages link to (Q4636534):
Displayed 6 items.
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- (Q5009482) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)