A table of upper bounds for binary codes, IEEE Transactions on Information Theory, vol.47, issue.7, pp.473004-3006, 2001. ,
DOI : 10.1109/18.959279
The packing coloring problem for lobsters and partner limited graphs, Discrete Applied Mathematics, vol.164, 2012. ,
DOI : 10.1016/j.dam.2012.08.008
The packing coloring problem for (q, q ? 4) graphs, to appear in Lecture Notes in Computer Science, 2012. ,
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees, Discrete Applied Mathematics, vol.155, issue.17, pp.2303-2311, 2007. ,
DOI : 10.1016/j.dam.2007.06.008
Complexity of the packing coloring problem for trees, Discrete Applied Mathematics, vol.158, issue.7, pp.771-778, 2010. ,
DOI : 10.1016/j.dam.2008.09.001
The packing chromatic number of infinite product graphs, European Journal of Combinatorics, vol.30, issue.5, pp.1101-1113, 2009. ,
DOI : 10.1016/j.ejc.2008.09.014
On the packing chromatic number of some lattices, Discrete Applied Mathematics, vol.158, issue.12, pp.1224-1228, 2010. ,
DOI : 10.1016/j.dam.2009.06.001
Broadcast Chromatic Numbers of Graphs, Ars Combinatoria, pp.86-119, 2008. ,
Balanced independent sets in hypercubes, Australasian J. of Combinatorics, vol.48, pp.57-72, 2010. ,