References
- T. Calamoneri, Exact solution of a class of frequency assignment problems in cellular networks and other regular grids, Discrete Math. Theor. Comput. Sci. 8 (2006), pp. 141–158.
- T. Calamoneri, The L(h,k)-labeling problem: A survey and annotated bibliography, Comput. J. 49(5) (2006), pp. 585–608. doi: 10.1093/comjnl/bxl018
- T. Calamoneri, The L(h,k)-Labelling Problem: An updated survey and annotated bibliography, Comput. J. 54 (2011), pp. 1344–1371. doi: 10.1093/comjnl/bxr037
- T. Calamoneri, S. Camaniti, and G. Fertin, L(h,k)-Labelling of regular grids, Int. J. Mobile Netw. Design Innovat. 1 (2006), pp. 92–101. doi: 10.1504/IJMNDI.2006.010811
- C. Charpentier, M. Montassier, and A. Raspaud, L(p,q)-labeling of sparse graphs, J. Comb. Optim. 25(4) (2013), pp. 646–660. doi: 10.1007/s10878-012-9507-6
- J.R. Griggs and X. Jin, Optimal channel assignments for the lattices with a condition at distance two, in Proceeding of the 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Network (W-MAN '05), Denver, Colorado. April 4–8, Vol. 13, pp. 238.1, IEEE Computer Society.
- J.R. Griggs and R.K. Yeh, Labeling graphs with a condition at distance two, SIAM J. Disc. Math. 5 (1992), pp. 586–595. doi: 10.1137/0405048
- E. Haque and P.K. Jha, L(j,k)-labelings of Kronecker products of complete graphs, IEEE Trans. Cir. Sys. II 55(1) (2008), pp. 70–73. doi: 10.1109/TCSII.2007.908918
- P.K. Jha, S. Klavžar, and A. Vesel, L(2,1)-labeling of direct products of paths and cycles, Disc. Appl. Math. 145 (2005), pp. 317–325. doi: 10.1016/j.dam.2004.01.019
- P.K. Jha, S. Klavžar, and A. Vesel, Optimal L(d,1)-labelings of direct products of cycles and Cartesian products of cycles, Disc. Appl. Math. 152 (2005), pp. 257–265. doi: 10.1016/j.dam.2005.04.007
- B. Kim, B. Song, Y. Rho, and W. Hwang, New L(j,k)-labelings of direct products of complete graphs, Taiwanese J. Math. 18 (2014), pp. 781–792.
- D. Korže and A. Vesel, L(2,1)-labeling of strong products of cycles, Inform. Process. Lett. 94 (2005), pp. 183–190. doi: 10.1016/j.ipl.2005.01.007
- D. Král and P. Škoda, Bounds for the real number graph labellings and application to labellings of the triangular lattice, SIAM J. Discret. Math. 22(4) (2008), pp. 1559–1569. doi: 10.1137/07068552X
- W. Lin and P. Zhang, On n-fold L(j,k)−and circular L(j,k)-labelings of graphs, Disc. Appl. Math. 160(16–17) (2012), pp. 2452–2461. doi: 10.1016/j.dam.2012.06.005
- D. Ma, L(p,q)-labeling of graph embeddable on the torus, Disc. Appl. Math. 173(16–17) (2014), pp. 70–76. doi: 10.1016/j.dam.2014.03.003
- C. Schwartz and D. Troxell, L(2,1)-labelings of Cartesian product of two cycles, Discret. Appl. Math. 154 (2006), pp. 1522–1540. doi: 10.1016/j.dam.2005.12.006
- M.A. Whittlesey, J.P. Georges, and D.W. Mauro, On the λ-number of Qn and related graphs, SIAM J. Disc. Math. 8 (1995), pp. 499–506. doi: 10.1137/S0895480192242821
- Q. Wu, L. Shiu, and P. Sun, Circular L(j,k)-labeling number of direct product of path and cycle, J. Comb. Optim. 27(2) (2014), pp. 355–368. doi: 10.1007/s10878-012-9520-9
- R.K. Yeh, A survey on labeling graphs with a condition two, Disc. Math. 306 (2006), pp. 1217–1231. doi: 10.1016/j.disc.2005.11.029
- P. Zhang and W. Lin, Multiple L(j,1)-labeling of the triangular lattice, Disc. Appl. Math. 173 (2014), pp. 70–76. doi: 10.1016/j.dam.2014.03.003