References

Alon, N. and B. Mohar, 2002. The chromatic number of graph powers. Comb. Probab. Comput., 11: 1-10.

Amanathulla, S.K. and M. Pal, 2016. L(3, 2, 1)-and L(4, 3, 2, 1)-labeling problems on circular-arc graphs. Int. J. Control Theory Appl., 9: 869-884.

Battiti, R., A.A. Bertossi and M.A. Bounccelli, 1999. Assigning code in wireless networks: Bounds and scaling properties. Wirel. Network, 5: 195-209.
CrossRef  |  Direct Link  |  

Bertossi, A.A. and C.M. Pinotti, 2007. Approximate L(ς₁, ς₂,....,ς_t-coloring of trees and interval graphs Networks, 49: 204-216.

Bertossi, A.A. and M.A. Bonuccelli, 1995. Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE. ACM. Trans. Networking, 3: 441-449.
CrossRef  |  Direct Link  |  

Bodlaender, H.L., T. Kloks, R.B. Tan and J.V. Leeuwen, 2004. Approximations for -colorings of graphs. Comput. J., 47: 193-204.

Calamoneri, T., 2006. Optimal L(h, k)-labeling of regular grids. Discret. Math. Theor. Comput. Sci., 8: 141-158.

Calamoneri, T., 2006. Optimal L(h, k)-labeling of regular grids. Discret. Math. Theor. Comput. Sci., 8: 141-158.

Calamoneri, T., 2014. The L(h, k)-labeling problem: An updated survey and annotated bibliography. Comput, J., 54: 1-54.

Calamoneri, T., S. Caminiti and R. Petreschi, 2009. On the L(h, k) -labeling of co-comparability graphs and circular-arc graphs. Networks, 53: 27-34.

Chang, G.J. and C. Lu, 2003. Distance two labelling of graphs. Eur. J. Comb., 24: 53-58.
Direct Link  |  

Chang, G.J. and D. Kua, 1996. The L(2, 1)-labeling on graphs. SIAM. J. Discrete Math., 9: 309-316.

Chiang, S.H. and J.H. Yan, 2008. On L(d,1)-labeling of cartesian product of a path. Discrete Appl. Mathe., 156: 2867-2881.
Direct Link  |  

Das, S.K., I. Finocchi and R. Petreschi, 2006. Conflict-free star-access in parallel memory systems. J. Parallel Distrib. Comput., 66: 1431-1441.
Direct Link  |  

Golumbic, M.C., 2004. Algorithmic Graph Theory and Perfect Graphs. 2nd Edn., Elsevier, Amsterdam, Netherlands, ISBN:0-444-51530-5, Pages: 313.

Griggs, J. and R.K. Yeh, 1992. Labeling graphs with a condition at distance two. SIAM. J. Discrete Math., 5: 586-595.
Direct Link  |  

Hale, W.K., 1980. Frequency assignment: Theory and applications. Proc. IEEE., 68: 1497-1514.
CrossRef  |  Direct Link  |  

Khan, N., M. Pal and A. Pal, 2012. L(0, 1)-lavelling of cactus graphs. Commun. Network, 4: 18-29.

Makansi, T., 1987. Transmitter-oriented code assignment for multihop packet radio. IEEE. Trans. Commun., 35: 1379-1382.
CrossRef  |  Direct Link  |  

Olariu, S., 1991. An optimal greedy heuristic to color interval graphs. Inf. Process. Lett., 37: 21-25.
Direct Link  |  

Pal, A. and M. Pal, 2009. Interval tree and its applications. Adv. Model. Optim., 11: 211-224.
Direct Link  |  

Pal, M. and G.P. Bhattacharjee, 1995. Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph. Int. J. Comput. Mathe., 59: 1-13.
Direct Link  |  

Pal, M. and G.P. Bhattacharjee, 1996. An optimal parallel algorithm to color an interval graph. Parallel Process. Lett., 6: 439-449.
Direct Link  |  

Pal, M. and G.P. Bhattacharjee, 1997. A data structure on interval graphs and its applications. J. Circuits Syst. Comput., 7: 165-175.
Direct Link  |  

Pal, M., 1995. Some sequential and parallel algorithms on interval graphs. Ph.D Thesis, Indian Institute of Technology, Kharagpur, India.

Pal, M., 2013. Intersection graphs: An introduction. Anal. Pure Appl. Math., 4: 41-93.
Direct Link  |  

Saha, A., M. Pal and T.K. Pal, 2007. Selection of programme slots of television channels for giving advertisement: A graph theoretic approach. Inf. Sci., 177: 2480-2492.
Direct Link  |  

Sakai, D., 1994. Labeling chordal graphs with a condition at distance two. SIAM. J. Discrete Math., 7: 133-140.
CrossRef  |  Direct Link  |  

Wan, P.J., 1997. Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Combin. Optim., 1: 179-186.
Direct Link  |