The following pages link to Paths to Trees and Cacti (Q5283353):
Displaying 7 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← 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)
