2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/115301We study k-dependence and half domination problems for king's graphs in dimension n (n>1). Various sharp bounds are provided and a few conjectures are formulated in the cases the estimates are not the best possible.22 pages, 3 figures, submitted in June of 2006Optimization and ControlCombinatorics90C35;90C05text