Pages that link to "Item:Q1059641"
From MaRDI portal
The following pages link to A note on the complexity of finding regular subgraphs (Q1059641):
Displayed 10 items.
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Addendum to: The complexity of regular subgraph recognition (Q1175798) (← links)
- The stable fixtures problem with payments (Q1651275) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Construction of k-matchings in graph products (Q5058206) (← links)
- Parameterized Graph Editing with Chosen Vertex Degrees (Q5505639) (← links)