Author:
Ghosh Sumonta,Sarkar Prosanta,Pal Anita
Reference16 articles.
1. Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68, 1497–1514 (1980)
2. Griggs, J., Yeh, R.K.: Labeling graphs with a condition at distance two. SIAM J. Discret. Math. 5, 586–595 (1992)
3. Krl, D., Skrekovski, R.: A theory about channel assignment problem. SIAM J. Discret. Math. 16, 426–437 (2003)
4. Havet, F., Reed, B., Sereni, J.S.: $$L(2, 1)$$-labeling of graphs. In: Proceedings of the 19th Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2008, pp. 621–630. SIAM, Philadelphia, PA (2008)
5. Gonalves, D.: On the L$$(d, 1)$$-labellinng of graphs. Discret. Math. 308, 1405–1414 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献