$k$-Dependence and Domination in Kings Graphs TeX Export

@article{citeulike:4216109, abstract = {We 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.}, archivePrefix = {arXiv}, author = {Ionascu, Eugen J. and Pritikin, Dan and Wright, Stephen E.}, citeulike-article-id = {4216109}, citeulike-linkout-0 = {http://arxiv.org/abs/math.OC/0608140}, citeulike-linkout-1 = {http://arxiv.org/pdf/math.OC/0608140}, day = {5}, eprint = {math.OC/0608140}, keywords = {article, binary, graphtheory, integerprogramming, optimization}, month = {Aug}, posted-at = {2009-03-24 23:27:19}, priority = {2}, title = {\$k\$-Dependence and Domination in Kings Graphs}, url = {http://arxiv.org/abs/math.OC/0608140}, year = {2006} }

TY - JOUR ID - citeulike:4216109 L3 - citeulike-article-id:4216109 N2 - We 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. TI - $k$-Dependence and Domination in Kings Graphs KW - article KW - binary KW - graphtheory KW - integerprogramming KW - optimization AU - Ionascu, Eugen AU - Pritikin, Dan AU - Wright, Stephen PY - 2006/Aug/05/ UR - http://arxiv.org/abs/math.OC/0608140 ER -