Pages that link to "Item:Q2942649"
From MaRDI portal
The following pages link to Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649):
Displayed 5 items.
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)