The following pages link to Split Contraction (Q5205814):
Displaying 7 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
