The L(h, k)-labelling problem: A survey and annotated bibliography

Computer Journal

Volumn 49, Issue 5, 2006, Pages 585-608

  Calamoneri, Tiziana ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

D2 vertex colouring; Distance 2 colouring; Frequency assignment; Lambda coloring; Radio colouring

Indexed keywords

ALGORITHMS; FREQUENCY ALLOCATION; GRAPH THEORY; INFORMATION THEORY; MATHEMATICAL MODELS; TOPOLOGY;

DISTANCE COLOURING; FREQUENCY ASSIGNMENT; LAMBDA-COLORING; VERTEX COLOURING;

TELECOMMUNICATION LINKS;

EID: 33750117332     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxl018     Document Type: Review

References (137)

1. Roberts, F. S. (1991) From Garbage to Rainbows: Generalizations of Graph Coloring and their Applications. In Alavi, Y., Chartrand, G., Oellermann, O. R. and Schwenk, A. J. (eds), Graph Theory, Combinatorics, and Applications, Wiley, New York.
2. Jensen, T. R. and Toft, B. (1995) Graph Coloring Problems, John Wiley & Sons, New York.
3. Griggs, J. R. and Yeh, R. K. (1992) Labeling graphs with a condition at distance 2. SIAM J. Discrete Math., 5, 586-595.
4. Yeh, R. K. (1990) Labeling Graphs with a Condition at Distance Two. PhD Thesis, University of South Carolina, Columbia, South Carolina.
5. Aardal, K. I., van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C. and Sassano, A. (2001) Models and solution techniques for frequency assignment problems. ZIB-Report 01-40, Konrad-Zuse-Zentrum fur Informationstechnik Berlin.
6. Eisenblätter, A., Grötschel, M. and Koster, A. M. C. A. (2000) Frequency Planning and Ramifications of Colorings, Technical Report 00-47 Konrad-Zuse-Zentrum für Informationstechnik Berlin.
7. Koster, A. M. C. A. (1999) Frequency Assignment. PhD Thesis, Universiteit Maastricht.
8. Murphey, R. A., Pardalos, P. M. and Resende, M. G. C. (1999) Frequency assignment problems. In Du, D.-Z. and Pardalos, P. M. (eds), Handbook of Combinatorial Optimization, pp. 295-377, Kluwer Academic Publishers.
9. Roberts, F. S. (1991) T-colorings of graphs: Recent results and open problems. Discrete Math., 93, 229-245.
10. Wegner, G. (1997) Graphs with Given Diameter and a Coloring Problem, Technical Report, University of Dortmund, Dortmund.
11. Bertossi, A. A. and Bonuccelli, M. A. (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ ACM Trans. Network., 3(4), 441-449.
12. Aly, K. A. and Dowd, P. W. (1994) A class of scalable optical interconnection networks through discrete broadcast-select multi-domain WDM. In Proc. IEEE INFOCOM, Toronto, Ontario, Canada, June, 12-16, pp. 392-399. EEEE Computer Society Press.
13. Shepherd, M. (1998) Radio Channel Assignment. PhD Thesis, Merton College, Oxford.
14. Duque-Anton, M., Kunz, D. and Rüber, B. (1993) Channel assignment for cellular radio using simulated annealing. IEEE Trans. Veh. Technol., 42, 14-21.
15. Mathar, R. and Mattfeld, J. (1993) Channel assignment in cellular radio networks. IEEE Trans. Veh. Technol., 42, 647-656.
16. Crompton, W., Hurley, S. and Stephen, N. M. (1994) A parallel genetic algorithm for frequency assignment problems. In Proc. IMACS/IEEE Int. Symp. on Signal Processing, Robotics and Neural Networks, Lille, France, pp. 81-84.
17. Lai, W. K. and Coghill, G. G. (1996) Channel assignment through evolutionary optimization. IEEE Trans. Veh. Technol., 45, 91-96.
18. Castelino, D., Hurley, S. and Stephens, N. M. (1996) A tabu search algorithm for frequency assignment. Ann. Oper. Res., 63, 301-319.
19. Funabiki, N. and Takefuji, Y. (1992) A neural network parallel algorithm for channel assignment problem in cellular radio networks. IEEE Trans. Veh. Technol., 41, 430-437.
20. Kunz, D. (1991) Channel assignment for cellular radio using neural networks. IEEE Trans. Veh. Technol., 40, 188-193.
21. Hale, W. K. (1980) Frequency assignment: Theory and applications. Proc. IEEE, 68, 1497-1514.
22. Roberts, F. S. (1993) No-hole 2-distance colorings. Math. Comput. Modell., 17, 139-144.
23. van den Heuvel, J., Leese, R. A. and Shepherd, M. A. (1998) Graph labelling and radio channel assignment. J. Graph Theory, 29, 263-283.
24. Griggs, J. R. (2003) Real number channel assignments with distance conditions Presented at. DIMACS/DIMATIA/Renyi Working Group on Graph Colorings and their Generalizations.
25. Fiala, J., Kratochvíl, J. and Proskurowski, A. (2001) Distance constrained labeling of precolored trees. In Proc. 7th Italian Conf. on Theoretical Computer Science (ICTCS'01), Torino, Italy, October 4-6, LNCS 2202, pp. 285-292. Springer-Verlag, Berlin.
26. Chang, G. J. and Kuo, D. (1996) The L(2, 1)-labeling problem on graphs. SIAM J. Discrete Math., 9, 309-316.
27. Chang, G. J., Chen, J.-J., Kuo, D. and Liaw, S.-C. (2004) Distance-Two Labelings of Digraphs, Technical report 2004-011, Mathematics division, National Center for Theoretical Sciences at Taipei.
28. Yeh, R. K. and Li, C.-S. (1997) The edge span of the distance two labelling of graphs. Taiwan. J. Math., 4(4), 675-684.
29. Lih, K. W. (1999) The equitable coloring of graphs. In Du, D.-Z. and Pardalos, P. M. (eds), Handbook of Combinatorial Optimization, pp. 543-566.
30. Yeh, R. K. (2004) A survey on labeling graphs with a condition at distance two. Manuscript.
31. Brandstadt, A., Le, V. B. and Spinrad, J. P. (1999) Graph Classes: A SurveySIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
32. Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G. and Spirakis, P. G. (2000) NP-completeness results and efficient approximations for radiocoloring in planar graphs. In Proc. 25th Int. Symp. on Mathematical Foundations of Computer Science (MFCS 2000), Bratislava, Slovak Republic, 28 August-1 September, LNCS 1893, pp. 363-372. Springer-Verlag, Berlin.
33. McCormick, S. T. (1983) Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Program., 26, 153-171.
34. Sen, A. and Huson, M. L. (1997) A new model for scheduling packet radio networks. Wirel. Netw., 3, 71-82.
35. Ramanathan, S. and Lloyd, E. L. (1992) The complexity of distance-2-coloring. In Proc. 4th Int. Conf. of Computing and Information (ICCI'92), May, 28-30, pp. 71-74. IEEE Computer Society Press.
36. Ramanathan, S. (1993) Scheduling Algorithms for Multi-Hop Radio Networks. PhD Thesis, Department of Computer Science, University of Delaware, Newark.
37. Heggernes, P. and Telle, J. A. (1998) Partitioning graphs into generalized dominating sets. Nordic J. Comput., 5(2), 128-143.
38. Ramanathan, S. and Lloyd, E. L. (1993) Scheduling algorithms for multi-hop radio networks. IEEE/ACM Trans. Netw., 1, 166-172.
39. Fiala, J., Kloks, T. and Kratochvíl, J. (2001) Fixed-parameter complexity of λ-labelings. Discrete Appl. Math., 113(1), 59-72.
40. Bodlaender, H. L., Kloks, T., Tan, R. B. and van Leeuwen, J. (2004) Approximations for λ-colorings of graphs. Comput. J., 47, 193-204.
41. Fiala, J. and Kratochvíl, J. (2005) On the computational complexity of the L(2,1)-labeling problem for regular graphs. In Proc. 11th Italian Conf. on Theoretical Computer Science (ICTCS '05), Siena, Italy, October 12-14, LNCS 3701, pp. 228-236. Springer-Verlag, Berlin.
42. Calamoneri, T. and Vocca, P. (2004) Approximability of the L(h,k)-labelling problem. In Proc. 12th Colloq. on Structural Information and Communication Complexity (SIROCCO 2005), Le Mont Saint-Michel, France, May 24-26, LNCS 3499, pp. 65-77. Springer-Verlag, Berlin.
43. Alon, N. and Mohar, B. (2002) The chromatic number of graph powers. Comb. Probab. Comput., 11, 1-10.
44. Jonas, K. (1993) Graph Coloring Analogues with a Condition at Distance Two: L(2, 1)-Labelings and List λ-Labelings. PhD Thesis, University of South Carolina, Columbia.
45. Král, D. and Škrekovski, R. (2003) A theorem about the channel assignment. SIAM J. Discrete Math., 16(3), 426-437.
46. Gonçalves, D. (2005) On the L(p,1)-labeling of graphs. In Proc. Eur. Conf. on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Germany, September 5-9, pp. 81-86. DMTCS Proceedings Volume AE.
47. Georges, J. P., Mauro, D. W. and Whittlesey, M. A. (1994) Relating path coverings to vertex labellings with a condition at distance two. Discrete Math., 135, 103-111.
48. Balakrislman, H. and Deo, N. (2003) Parallel algorithm for radiocoloring a graph. Congr. Numer., 160, 193-204.
49. Nordhaus, E. A. and Gaddun, J. W. (1956) On complementary graphs. Amer. Math. Mon., 63, 175-177.
50. Chang, G. J., Ke, W.-T., Kuo, D., Liu, D. D.-F. and Yeh, R. K. (2000) On L(d, 1)-labelings of graphs. Discrete Math., 220, 57-66.
51. Chang, G. J. and Lu, C. (2003) Distance-two labelings of graphs. Eur. J. Comb., 24(1), 53-58.
52. Georges, J. P. and Mauro, D. W. (1995) Generalized vertex labeling with a condition at distance two. Congr. Numer., 109, 141-159.
53. Makansi, T. (1987) Transmitter-oriented code assignment for multihop packet radio. IEEE Trans. Commun., 35(12), 1379-1382.
54. Battiti, R., Bertossi, A. A. and Bonuccelli, M. A. (1999) Assigning codes in wireless networks: Bounds and scaling properties. Wirel. Netw., 5, 195-209.
55. Kohl, A. (2006) Bounds for the L(d, 1)-number of diameter 2 graphs, trees and cacti. Int. J. Mobile Netw. Des. Innov., in press.
56. Sen, A., Roxborough, T. and Medidi, S. (1998) Upper and lower bounds of a class of channel assignment problems in cellular networks. In Proc. IEEE INFOCOM 1998, San Francisco CA, 29 March-2 April, 3, pp. 1273-1283. IEEE Computer Society Press.
57. Bertossi, A. A., Pinotti, C. M. and Tan, R. B. (2003) Channel assignment with separation for interference avoidance in wireless networks. IEEE Trans. Parall. Distrib. Syst., 14(3), 222-235.
58. Calamoneri, T. and Petreschi, R. (2004) L(h,1)-labeling subclasses of planar graphs. J. Parall. Distrib. Comput., 64(3), 414-426.
59. Das, S. K., Finocchi, I. and Petreschi, R. (2004) Star-coloring of graphs for conflict-free access to parallel memory systems. In Proc. 18th Int. Parallel & Distributed Processing Symp. (IPDPS '04), Santa Fe, NM, April 26-30. IEEE Computer Society.
60. Calamoneri, T. (2003) Exact solution of a class of frequency assignment problems in cellular networks and other regular grids. In Proc. 8th Italian Conf. on Theoretical Computer Science (ICTCS'03), Bertinoro, Italy, October 13-15, LNCS 2841, pp. 163-173. Springer-Verlag, Berlin.
61. Calamoneri, T., Caminiti, S. and Fertin, G. (2006) L(h, k)-labelling of regular grids. Int. J. Mobile Netw. Des. Innov., in press.
62. Kohl, A. (2003) On the L(d, 1)-Labelling of Regular Tilings and Powers of Paths and Cycles, Technical Report 2003-07 Technishe Universitat Freiberg.
63. Griggs, J. R. and Jin, X. (2005) Optimal channel assignments for the lattices with a condition at distance two. In Proc. 5th Int. Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (W-MAN '05), Denver, Colorado, April 4-8. IEEE Computer Society.
64. Dubhashi, A. N., Shashanka, M. V. S., Pati, A., Shashank, R. and Shende, A. M. (2002) Channel assignment for wireless networks modelled as d-dimensional square grids. In Proc. Int. Workshop on Distributed Computing (IWDC '02), Calcutta, India, December 28-31, LNCS 2571, pp. 130-141. Springer-Verlag, Berlin.
65. Fertin, G. and Raspaud, A. (2003) L(p, q) labeling of d-dimensional grids. In Eur. Conf. on Combinatorics, Graph Theory and Applications (EuroComb '03), Prague, Czech Republic, September 8-12.
66. n and related graphs. SIAM J. Discrete Math., 8, 499-506.
67. Jha, P. K., Narayanan, A., Sood, P., Sundaran, K. and Sunder, V. K. (2000) On L(2, 1)-labeling of the Cartesian product of a cycle and a path. Ars Comb., 55, 81-89.
68. Klavžar, S. and Vesel, A. (2003) Computing graph invariants on rotographs using dynamic algorithm approach: The case of (2, 1)-colorings and independence. Discrete Appl. Math., 129, 449-460.
69. Kuo, D. and Yan, J.-H. (2004) On L(2, 1)-labelings of Cartesian products of paths and cycles. Discrete Math., 283, 137-144.
70. Jha, P. K., Klavžar, S. and Vesel, A. (2005) L(2, 1)-labeling of direct product of paths and cycles. Discrete Appl. Math., 145(2), 317-325.
71. Schwarz, C. and Sakai Troxell, D. (2003) L(2, 1)-Labelings of Products of Two CyclesDIMACS Technical Report 2003-33.
72. Jha, P. K. (2000) Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination. IEEE Trans. Circ. Syst. - I: Fundam. Theory Appl., 47, 1531-1534.
73. Jha, P. K. (2001) Optimal L(2, 1)-labeling of strong Cartesian products of cycles. IEEE Trans. Circ. Syst. - I: Fundam. Theory Appl., 48, 498-500.
74. Korže, D. and Vesel, A. (2005) L(2, 1)-labeling of strong products of cycles.. Inform. Proces. Lett., 94, 183-190.
75. Georges, J. P., Mauro, D. W. and Stein, M. I. (2000) Labeling products of complete graphs with a condition at distance two. SIAM J. Discrete Math., 14, 28-35.
76. 2-Conjecture for L(2, 1)-labelings is true for directed and strong products of graphs. Manuscript.
77. Shao, Z. and Yeh, R. K. (2005) The L(2, 1)-labeling and operations of graphs. IEEE Trans. Circuits Syst. I Fund. Theory Appl., 52, 668-671.
78. Jha, P. K., Klavžar, S. and Vesel, A. (2005) Optimal L(d, 1)-labelings of directed products of cycles and Cartesian products of cycles. Discrete Appl Math., in press.
79. j-numbers of the products of complete graphs. Congr. Numer., 140, 141-160.
80. Erwin, D. J., Georges, J. P. and Mauro, D. W. (2003) On labeling the vertices of products of complete graphs with distance constraints. Naval Res. Logist., 52, 138-141.
81. Bertossi, A. A., Pinotti, C. M. and Rizzi, R. (2003) Channel assignment on strongly-simplicial graphs. In Proc. Int. Parallel and Distributed Processing Symp. (IPDPS '03), Nice, France, April 22-26. IEEE Computer Society.
82. Sakai Troxell, D. (1994) On Critical Trees Labeled with a Condition at Distance Two, DIMACS Technical Report 2004-43.
83. Wang, W.-F. Distance two labellings of planar graphs. Manuscript.
84. Welsh, D. (1999) Private communication with J. Fiala, J. Kratochvíl and A. Proskurowski.
85. Georges, J. P. and Mauro, D. W. (2003) Labeling trees with a condition at distance two. Discrete Math., 269, 127-148.
86. Calamoneri, T., Pelc, A. and Petreschi, R. (2005) Labeling trees with a condition at distance two. Discrete Math., in press.
87. Bodlaender, H. L. (1998) A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci., 209(1-2), 1-45.
88. Reed, B. A. (2003) Algorithmic aspects of treewidth. In Reed, B. A. and Sales, C. L. (eds), Recent Advances in Algorithms and Combinatorics. Springer-Verlag, Berlin.
89. Report of the Project. Critical Resource Sharing for Cooperation in Compler Systems (Crescco) funded by the European Community under the "Information Society Technologies" Programme (1998-2002), Technical Report IST-2001-33135.
90. Zhou, X., Kanari, Y. and Nishizeki, T. (2000) Generalized vertex-coloring of partial k-trees. IEICE Trans. Fundam. Electron., Commun. Comput. Sci., E83-A, 671-678.
91. Krumke, S. O., Marathe, M. V. and Ravi, S. S. (2001) Models and approximation algorithms for channel assignment in radio networks. Wirel. Netw., 7, 575-584.
92. Thomassen, C. (2001) Applications of Tutte Cycles, Technical Report MAT 2001-16, Technical University of Denmark, Copenhagen.
93. Wan, P. J. (1997) Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube Network. J. Comb. Optim., 1, 179-186.
94. van den Heuvel, J. and McGuinnes, S. (2003) Colouring the square of a planar graphs. J. Graph Theory, 42, 110-124.
95. Agnarsson, G. and Halldórsson, M. (2000) Coloring powers of planar graphs. In Proc. 11th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA 2000), San Francisco, CA, pp. 654-662.
96. Borodin, O. V., Broersma, H. J., Glebov, A. and van den Heuvel, J. (2001) Stars and Bunches in Planar Graphs. Part II: General Planar Graphs and Colourings. Technical Report, London School of Economics, London, 2002. Translated and adapted from Diskretn. Anal. Issled. Oper. Ser., 1(8), 9-33, (in Russian).
97. Molloy, M. and Salavatipour, M. R. (2005) A bound on the chromatic number of the square of a planar graph. J. Comb. Theory (Ser. B), 94(2), pp. 189-213.
98. Wang, W.-F. and Lih, K.-W. (2003) Labeling planar graphs with conditions on girth and distance two. SIAM J. Discrete Math., 17(2), pp. 264-275.
99. Bella, P., Král, D., Mohar, B. and Quittnerová, K. (2005) Labeling planar graphs with a condition at distance two. In Proc. Eur. Conf. on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Germany, September 5-9, pp. 41-44. DMTCS Proceedings Volume AE.
100. Dvořák, Z., Král, D., Nejedlý, P. and Škrekovski, R. (2005) Coloring Squares of Planar Graphs with No Short Cycles, ITI Report 2005-243.
101. Bodlaender, H. L. (1988) Dynamic programming on graphs of bounded treewidth. In Proc. 15th Int. Colloq. on Automata, Languages and Programming (ICALP'88), Tampere, Finland, July 11-15, LNCS 317, pp. 105-118. Springer-Verlag, Berlin.
102. Calamoneri, T. and Petreschi, R. (2004) l(h,1)-labeling subclasses of planar graphs. J. Parall. Distrib. Comput., 64(3), 414-426.
103. Agnarsson, G. and Halldórsson, M. M. (2004) On colorings of squares of outerplanar graphs. In Proc. 15th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), New Orleans, LA, January, 11-13, pp. 242-253.
104. Bruce, R. J. and Hoffmann, M. (2003) L(p, q)-Labeling of Outerplanar Graphs. Technical Report No. 2003/9, Department of Mathematics and Computer Science, University of Leicester, England.
105. Chartrand, G. and Harary, F. (1967) Planar permutation graphs. Ann. Inst. H. Poincaré, sect. B(N. S.), 3, 433-438.
106. 4-minor free graph. Discrete Math., 269, 303-309.
107. Agnarsson, G., Greenlaw, R. and Halldórsson, M. M. (2000) On powers of chordal graphs and their colorings. Congr. Numer., 144, 41-65.
108. Breu, H. and Kirkpatrick, D. G. (1998) Unit disk graph recognition is NP-hard. Comput. Geom.: Theory Appl., 9, 3-24.
109. Hliněný, P. and Kratochvíl, J. (2001) Representing graphs by disks and balls (a survey of recognition complexity results). Discrete Math., 229(1-3), 101-124.
110. Teng, S. H. (1991) Points, Spheres and Separators, A Unified Geometric Approach to Graph Separators. PhD Thesis, School of Computer Science, Carnegie Mellon University, CMU-CS-91-184, Pittsburgh.
111. Sen, A. and Malesinska, E. (1997) Approximation algorithms for radio network schedulings. In Proc. 35th Allerton Conf. on Communication, Control and Computing, Allerton, IL, pp. 573-582.
112. Ma, X. and Loyd, E. L. (1999) Personal communication with Krumke, S. O., Marathe, M. V. and Ravi, S. S.
113. Wan, P.-J. Conflict-free channel assignment in wireless ad hoc networks. Lecture 9 of course "Wireless Networking" at Illinois Institute of Technology.
114. Fiala, J., Fishkin, A. V. and Fomin, F. V. (2004) On distance constrained labeling of disk graphs. Theor. Comput. Sci., 326(1-3), 261-292.
115. Král, D. (2005) Coloring powers of chordal graphs. SIAM J. Discrete Math., 18(3), 451-461.
116. Raychauduri, A. (1987) On powers of interval and unit interval graphs. Congr. Numer., 59, 235-242.
117. Sakai, D. (1994) Labeling chordal graphs: Distance two condition. SIAM J. Discrete Math., 7, 133-140.
118. Calamoneri, T., Caminiti, S., Olariu, S. and Petreschi, R. (2006) L(h, k)-labeling of graphs with a linear node order. Manuscript.
119. Jonas, K. Private communications to J. R. Griggs.
120. Frieder, O., Harary, F. and Wan, P.-J. (2002) A radio coloring of a hypercube. Int. J. Comput. Math., 79(6), 665-670.
121. Calamoneri, T., Caminiti, S. and Petreschi, R. (2005) A general approach to L(hk)-label interconnection networks. In Proc. 2nd Brazilian Symp. on Graphs, Algorithms and Combinatorics (GRACO '05), Rio de Janeiro, Brazil, April 27-29, pp. 178-184. Electronic Notes in Discrete Mathematics.
122. Zhon, S. (2006) Labelling Cayley graphs on Abelian groups. SIAM J. Discrete Math., 19(4), 985-1003.
123. Corneil, D. G., Perl, Y. and Stewart, L. K. (1985) A linear recognition algorithm for cographs. SIAM J. Comput., 14, 926-934.
124. Kang, J.-H. (2005) L(2, 1)-labelling for 3-regular Hamiltonian graphs. Manuscript.
125. Georges, J. P. and Mauro, D. W. (2003) On regular graphs optimally labeled with a condition at distance two. SIAM J. Discrete Math., 17(2), 320-331.
126. Erdös, P., Fajtlowicz, S. and Hoffman, A. J. (1980) Maximum degree in graphs of diameter 2. Networks, 10, 87-90.
127. Junker, M. (2003) Moore Graphs, Latin Squares and Outer Automorphisms. Technical Report Albert Ludwigs Univ., Freiburg, Germany.
128. Marchioro, P., Morgana, A., Petreschi, R. and Simeone, B. (1984) Degree sequences of matrogenic graphs. Discrete Math., 51, 47-61.
129. Foldes, S. and Hammer, P. (1978) On a class of matroid producing graphs. Colloq. Math. Soc. J. Bolyai (Combinatorics), 18, 331-352.
130. Peled, U. N. (1977) Matroidal graphs. Discrete Math., 20, 263-286.
131. Calamoneri, T. and Petreschi, R. (2006) L(2,1)-coloring matrogenic graphs. Discrete Appl. Math., in press.
132. Georges, J. P. and Mauro, D. W. (2002) On generalized Petersen graphs labeled with a condition at distance two. Discrete Math., 259, 311-318.
133. Damaschke, P. (1992) Distance in cocomparability graphs and their powers. Discrete Appl. Math., 35, 67-72.
134. Lovász, L. (1978) Kneser's conjecture, chromatic number, and homotopy. J. Comb. Theory, Ser. A, 25, 319-324.
135. Kang, J.-H. (2005) L(2, 1)-labelling for Kneser graphs. Manuscript.
136. Gravier, S., Klavžar, S. and Mollard, M. (2004) Codes and L(2,1)-labelings in Sierpiński graphs. Taiwan. J. Math., 4, 671-681.
137. Lih, K.-W. and Wang, W.-F. (2004) Coloring the square of an outerplanar graph. Taiwan. J. Math., in press.