Pages that link to "Item:Q471188"
From MaRDI portal
The following pages link to Parameterized complexity of three edge contraction problems with degree constraints (Q471188):
Displaying 15 items.
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- An improved linear kernel for the cycle contraction problem (Q2274484) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← 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)
