1. Bertossi, A.A., Pinotti, M.C., Rizzi, R.: Channel assignment on strongly-simplicial graphs. In: 17th International Symposium on Parallel and Distributed Processing, p. 222. IEEE Computer Society, Washington (2003)
2. Calamoneri, T.: The L(h,k)-labelling problem: a survey and annotated bibliography. Comput. J. 49, 585–608 (2006)
3. Chang, G.J., Ke, W.T., Kuo, D., Liu, D.F., Yeh, R.K.: On L(d,1)-labelings of graphs. Discrete Math. 220, 57–66 (2000)
4. Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM J. Discrete Math. 9, 309–316 (1996)
5. Courcelle, B.: The monadic second-order logic of graphs. I: recognizable sets of finite graphs. Inform. and Comput. 85, 12–75 (1990)