Proves that k-limited domination is NP-complete for fixed k >= 2 and derives sharp bounds and exact values for the parameter on Cartesian products.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On $k$-limited domination: complexity and Cartesian products
Proves that k-limited domination is NP-complete for fixed k >= 2 and derives sharp bounds and exact values for the parameter on Cartesian products.