References
- T. Calamoneri, The -labelling problem: an updated survey and annotated bibliography, Comput. J. 54 (2011), pp. 1344–1371. doi: 10.1093/comjnl/bxr037
- T. Calamoneri, E. Fusco, R.B. Tan, and P. Vocca, -labeling of outerplanar graphs, in 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), Lecture Notes in Computer Science, Vol. 4056, 2006, pp. 268–279.
- G.J. Chang and D. Kuo, The -labeling problem on graphs, SIAM J. Discret. Math. 9 (1996), pp. 309–316. doi: 10.1137/S0895480193245339
- M. Chia, D. Kuo, H. Liao, C. Yang, and R.K. Yeh, -labeling of graphs, Taiwanese J. Math. 15 (2011), pp. 2439–2457.
- J. Fiala, P.A. Golovach, J. Kratochvíl, B. Lidický, and D. Paulusma, Distance three labelings of trees, Discret Appl. Math. 160(6) (2012), pp. 764–779. doi: 10.1016/j.dam.2011.02.004
- J.P. Georges and D.W. Mauro, Labeling trees with a condition at distance two, Discret Math. 269 (2003), pp. 127–148. doi: 10.1016/S0012-365X(02)00750-1
- P.A. Golovach, B. Lidický, and D. Paulusma, -labeling is NP-complete for trees, in Theory and Applications of Models of Computation, A. Li, J. Fiala, and P. Kolman, eds., Springer, Berlin, 2010, pp. 211–221.
- J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discret. Math. 5 (1992), pp. 586–595. doi: 10.1137/0405048
- W.K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68 (1980), pp. 1497–1514. doi: 10.1109/PROC.1980.11899
- T. Hasunuma, T. Ishii, H. Ono, and Y. Uno, A linear time algorithm for -labeling of trees, Algorithmica 66 (2013), pp. 654–681. doi: 10.1007/s00453-012-9657-z
- B. Kim, B. Song, and W. Hwang, Distance three labelings for direct products of three complete graphs, Taiwanese J. Math. 17 (2013), pp. 207–219.
- D. King, C.J. Ras, and S. Zhou, The -labelling problem for trees, Europ. J. Combin. 31 (2010), pp. 1295–1306. doi: 10.1016/j.ejc.2009.11.006
- J. Liu and Z. Shao, The -labeling problem on graphs, Math. Appl. 17 (2004), pp. 596–602.
- Z. Shao and A. Vesel, -labeling of triangular and toroidal grids, Central Eur. J. Oper. Res, 23 (2015), pp. 659–673. doi: 10.1007/s10100-014-0365-4
- W.F. Wang, The -labelling of trees, Discret. Appl. Math. 154 (2007), pp. 598–603. doi: 10.1016/j.dam.2005.09.007
- R.K. Yeh, A survey on labeling graphs with a condition at distance two, Discret. Math. 306 (2006), pp. 1217–1231. doi: 10.1016/j.disc.2005.11.029
- X.L. Zhang and K.C. Deng, Characterization results for the -labeling problem on trees, Discussiones Mathematicae Graph Theory, 2016. Available at http://www.discuss.wmie.uz.zgora.pl/php/discuss3.php?ip=&url=pdf&sTyp=pracaPDF&nIdA=2368&nIdSesji=-1.
- S. Zhou, A distance labeling problem for hypercubes, Discret. Appl. Math. 156 (2008), pp. 2846–2854. doi: 10.1016/j.dam.2007.11.018