1 |
R. K. Yeh, A survey on labeling graphs with a condition two, Disc. Math., 306 (2006)., 1217-123
DOI
|
2 |
A. A. Bertossi and M. C. Pinotti, Channel assignment with separation for inter-ference avoidence in weierless networks, IEEE Trans. Parall. Distrib. Syst. 14 (2003), 222-235.
DOI
|
3 |
A. A. Bertossi and M. C. Pinotti, Approximate L( )-coloring of trees and interval graphs, Networks 49 (3) (2007), 204-216.
DOI
|
4 |
A. A. Bertossi, M. C. Pinotti and R. Tan, Efficient use of Radio spectrum in weierless networks with channel separation between close stations, dial M for mobility: International ACM workshop, Discrete algorithms and methods for mobile computing, (2000).
|
5 |
T. Calamoneri, The L(h; k)-labeling problem: A survey and annotated bibliogra-phy Comp. J. 49 (2006), 585-608.
DOI
|
6 |
T. Calamoneri, The L(h; k)-Labelling Problem: An Updated Survey and Anno-tated Bibliography, Comp. J. 54 (2011), 1344-1371.
DOI
|
7 |
T. Calamoneri, Optimal L( )- labelling of eight-regular grids, Inform. Pro-cess. Lett., 113 (2013), 361-364.
DOI
|
8 |
G. J. Chang and D. Kuo, The L(2; 1)-labeling problem on graphs, SIAM J Dis-crete Math., 9, 309-316 (1996).
DOI
|
9 |
M. L. Chia, D. Kuo, H. Liao, C. H. Yang and R. K. Yeh, L(3; 2; 1) labeling of graphs, Taiwan. J. Math. 15 (2011), 2439-2457.
DOI
|
10 |
J. R. Griggs and R. K. Yeh, Labeling graphs with a condition at distance two, SIAM J. Discrete Math. 5 (1992), 586-595.
DOI
|
11 |
W. K. Hale, Frequency assignment: theory and application, Proc. IEEE 68 (1980), 1497-1514.
DOI
|
12 |
B. M. Kim, W. Hwang and B. C. Song, L(3; 2; 1)-labeling for the product of a complete graph and a cycle, Taiwan. J. Math., 19 (2015), 819-848.
DOI
|
13 |
B. M. Kim, B. C. Song and W. Hwang, Distance three labelings for direct products of three complete graphs, Taiwan. J. Math. 17 (2013), 207-219.
DOI
|
14 |
B. M. Kim, B. C. Song and W. Hwang, Distance three labellings for , Int. J. Comput. Math., 90 (5) (2013), 906-911.
DOI
|
15 |
S. Zhou, A distance-labelling problem for hypercubes, Discrete Appl. Math. 156 (15) (2008), 2846-2854.
DOI
|
16 |
J. Liu and Z. Shao, The L(3; 2; 1)-labeling problem on graphs, Math. Appl. 17 (2004), 596-602.
|
17 |
Z. Shao and A. Vesel, Integer linear programming model and satisfiability test reduction for distance constrained labellings of graphs: the case of L(3; 2; 1) la-belling for products of paths and cycles, IET Commun. 7 (2013), 715-720.
DOI
|
18 |
Z. Shao and A. Vesel, L(3,2,1) -labeling of triangular and toroidal grids, Cent. Eur. J. Oper. Res. 23 (2015), 659-673.
DOI
|