Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference17 articles.
1. Calamoneri T, Petreschi R (2004) $$L(h,1)$$ L ( h , 1 ) -labeling subclasses of planar graphs. J Parallel Distrib Comput 64:414–426
2. Calamoneri T (2006) Optimal $$L(h, k)$$ L ( h , k ) -labeling of regular grids. Discret Math Theor Comput Sci 8:141–158
3. Calamoneri T, Caminiti S, Fertin G (2006) New bounds for the $$L(h, k)$$ L ( h , k ) -number of regular grids. Int J Mob Netw Des Innov 1(2):92–101
4. Calamoneri T (2011) The L(h, k)-labeling problem: an updated survey and annotated bibliography. Comput J 54(8):1344–1371
5. Dai B, Lin W (2012a) On $$(s, t)$$ ( s , t ) -relaxed $$L(2,1)$$ L ( 2 , 1 ) -labelings of the hexagonal lattice (under review)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献