1 |
W.K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68 (1980), 1497-1514.
DOI
|
2 |
J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992), 586-595.
DOI
|
3 |
G.J. Chang and D. Kuo, The L(2; 1)-labeling problem on graphs, SIAM J. Discrete Math. 9 (1996), 309-316.
DOI
|
4 |
J.P. Georges and D.W. Mauro, Labeling trees with a condition at distance two, Discrete Math. 269 (2003), 127-148.
DOI
|
5 |
W.F. Wang, The L(2; 1)-labelling of trees, Discrete Appl. Math. 154 (2007), 598-603.
DOI
|
6 |
R.K. Yeh, A survey on labeling graphs with a condition at distance two, Discrete Math. 306 (2006), 1217-1231.
DOI
|
7 |
T. Calamoneri, The L(h; k)-labelling problem: an updated survey and annotated bibliography, Comput. J. 54 (2011), 1344-1371.
DOI
|
8 |
D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou and P.G. Spirakis, Radio-coloring in planar graphs: Complexity and approximations, Theo. Comput. Sci. 340 (2005), 514-538.
DOI
|
9 |
J. Griggs and D. Liu, Minimum span channel assignments, Recent Advances in Radio Channel Assignments, Invited Minisymposium, Discrete Math. (1998).
|
10 |
D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou and P.G. Spirakis, NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs, In: Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes of Computer Science, vol. 1893, pp. 363-372. Springer (2000).
|
11 |
K.W. Lih and W.F. Wang, Coloring the square of an outerplanar graph, Taiwanese J. Math. 10 (4) (2006), 1015-1023.
DOI
|
12 |
Y.L. Lin and S. Skiena, Algorithms for square roots of graphs, SIAM J. Discrete Math. 8 (1995), 99-118.
DOI
|