Pages that link to "Item:Q385061"
From MaRDI portal
The following pages link to Increasing the minimum degree of a graph by contractions (Q385061):
Displaying 10 items.
- Graph editing to a fixed target (Q344855) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Obtaining split graphs by edge contraction (Q897961) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- An improved linear kernel for the cycle contraction problem (Q2274484) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
