Multiple L(j,1)-labeling of the triangular lattice-Reference-Cited by-同舟云学术

Multiple L(j,1)-labeling of the triangular lattice

Published:2012-09-18 Issue:4 Volume:27 Page:695-710
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Zhang Pu,Lin Wensong

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-012-9549-9.pdf

Reference22 articles.

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

2. Calamoneri T (2011) The L(h,k)-labeling problem: an updated survey and annotated bibliography. Comput J 54(8):1344–1371

3. Calamoneri T, Caminiti S, Fertin G (2006) New bounds for the L(h,k)-number of regular grids. Int J Mobile Netw Design Innovat 1(2):92–101

4. Chvátal V, Garey MR, Johnson DS (1978) Two results concerning multicoloring. Ann Discrete Math 2:151–154

5. Goodwin J, Johnston D, Marcus A (2000) Radio channel assignments. UMAP J 21:369–378

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. n-fold L(2, 1)-labelings of Cartesian product of paths and cycles;Journal of Combinatorial Optimization;2024-04

2. Channel assignment problem and n-fold t-separated $$L(j_1,j_2,\ldots ,j_m)$$ L ( j 1 , j 2 , … , j m ) -labeling of graphs;Journal of Combinatorial Optimization;2018-02-20

3. On -relaxed -labelings of the square lattice;Information Processing Letters;2013-09

4. On $$(s,t)$$ ( s , t ) -relaxed $$L(2,1)$$ L ( 2 , 1 ) -labelings of the triangular lattice;Journal of Combinatorial Optimization;2013-04-09