References
- F. Bonomo and M.R. Cerioli, On the L(2, 1)-labelling of block graphs, Int. J. Comput. Math. 88(3) (2011), pp. 468–475. doi: 10.1080/00207161003650075
- T. Calamoneri, The L(h,k)-labeling problem: An updated survey and annotated bibliography, Comput. J. 54(8) (2011), pp. 1344–1371. doi: 10.1093/comjnl/bxr037
- J. Fiala, T. Kloks, and J. Kratochvil, Fixed-parameter complexity of λ-labelings, Discrete Appl. Math. 113(1) (2001), pp. 59–72. doi: 10.1016/S0166-218X(00)00387-5
- O. Frieder, F. Harary, and P.-J. Wan, A radio coloring of a hypercube, Int. J. Comput. Math. 79(6) (2002), pp. 665–670. doi: 10.1080/00207160211287
- J.R. Griggs and X.T. Jin, Recent progress in mathematics and engineering on optimal graph labellings with distance conditions, J. Comb. Optim. 14(2–3) (2007), pp. 249–257. doi: 10.1007/s10878-007-9055-7
- J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete 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
- J. van den Heuvel, R.A. Leese, and M.A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory 29 (1998), pp. 263–283. doi: 10.1002/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V
- P.K. Jha, A. Narayanan, and P. Sood, On the L(2, 1)-labeling of Cartesian product of a cycle and a path, Ars Combin. 55 (2000), pp. 81–89.
- P.K. Jha, S. Klavžar, and A. Vesel, L(2, 1)-labeling of direct product of paths and cycles, Discrete Appl. Math. 145 (2005), pp. 317–325. doi: 10.1016/j.dam.2004.01.019
- B.M. Kim, B.C. Song, and Y. Rho, L(2, 1)-labellings for direct products of a triangle and a cycle, Int. J. Comput. Math. 90 (2013), pp. 475–482.
- D. Kuo and J. Yan, On L(2, 1)-labelings of Cartesian products of paths and cycles, Discrete Math. 283(1–3) (2004), pp. 137–144. doi: 10.1016/j.disc.2003.11.009
- P.C.B. Lam, W. Lin, and J. Wu, L(j, k)- and circular L(j, k)-labellings for the products of complete graphs, J. Combin. Optim. 14 (2007), pp. 219–227. doi: 10.1007/s10878-007-9057-5
- R.A. Leese and S.D. Noble, Cyclic labellings with constraints at two distance, Electron. J. Combin. 11 (2004), pp. 1–16.
- W. Lin and P.C.B. Lam, Distance two labelling and direct products of graphs, Discret Math. 308(17) (2008), pp. 3805–3815. doi: 10.1016/j.disc.2007.06.046
- D.D.F. Liu, Hamiltonicity and circular distance two labellings, Discrete Math. 232 (2001), pp. 163–169. doi: 10.1016/S0012-365X(00)00299-5
- D.D.F. Liu and X. Zhu, Circulant distant two labeling and circular chromatic number, Ars Combin. 69 (2003), pp. 177–183.
- D. Lü, W. Lin, and Z. Song, L(2, 1)-circular labelings of Cartesian products of complete graphs, J. Math. Res. Expo. 29(1) (2009), pp. 91–98.
- B. Mohar, Circular coloring of edge-weighted graphs, J. Graph Theory 43 (2003), pp. 107–116. doi: 10.1002/jgt.10106
- Q. Wu and W. Lin, Circular L(j, k)-labeling numbers of trees and products of graphs, J. Southeast Univ. (English Edition), 26(1) (2010), pp. 142–145.
- Q. Wu, W.C. Shiu, and P.K. 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 at distance two, Discrete Math. 306 (2006), pp. 1217–1231. doi: 10.1016/j.disc.2005.11.029