Pages that link to "Item:Q414424"
From MaRDI portal
The following pages link to Parameterized complexity of finding small degree-constrained subgraphs (Q414424):
Displaying 8 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Minimum <i>k</i>‐cores and the <i>k</i>‐core polytope (Q6087566) (← links)
