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

Computer Journal

Volumn 54, Issue 8, 2011, Pages 1344-1371

  Calamoneri, Tiziana ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

colouring; D2 vertex colouring; distance 2 colouring; frequency assignment; L(h, k) labelling; radiocolouring

Indexed keywords

D2-VERTEX COLOURING; DISTANCE-2-COLOURING; FREQUENCY ASSIGNMENTS; L(H, K)-LABELLING; RADIOCOLOURING;

SURVEYS;

EID: 79960560610     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxr037     Document Type: Review

References (184)

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. andToft, B. (1995) Graph Coloring Problems. John Wiley & Sons, NewYork.
3. Hale, W.K. (1980) Frequency assignment: theory and applications. Proc. IEEE, 68, 1497-1514.
4. Griggs, J.R. and Yeh, R.K. (1992) Labeling graphs with a condition at distance 2. SIAM J. Discrete Math., 5, 586-595.
5. Yeh, R.K. (1990) Labeling graphs with a condition at distance two. PhD Thesis, University of South Carolina, Columbia, South Carolina.
6. 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.
7. Eisenblätter, A., Grötschel, M. and Koster, A.M.C.A. (2000) Frequency planning and ramifications of colorings. Discus. Math. Graph Theory, 22, 51-88.
8. Koster, A.M.C.A. (1999) Frequency assignment. PhD Thesis, Universiteit Maastricht.
9. 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.
10. Roberts, F.S. (1991) T-Colorings of graphs: recent results and open problems. Discrete Math., 93, 229-245.
11. Wegner, G. (1977) Graphs with Given Diameter and a Coloring POroblem. Tech. Rep. University of Dortmund, Dortmund.
12. Bertossi, A.A. and Bonuccelli, M.A. (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Netw., 3, 441-449.
13. Aly, K.A. and Dowd, P.W. (1994) A Class of Scalable Optical Interconnection Networks through Discrete Broadcast-Select Multi-Domain WDM. In Proceedings of IEEE INFOCOM, Toronto, Ontario, Canada, June 12-16, pp. 392-399. IEEE Computer Society Press.
14. Shepherd, M. (1998) Radio channel assignment. PhD Thesis, Merton College, Oxford.
15. 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.
16. Mathar, R. and Mattfeld, J. (1993) Channel assignment in cellular radio networks. IEEE Trans. Veh. Technol., 42, 647-656.
17. Crompton,W., Hurley, S. and Stephen, N.M. (1994) A Parallel Genetic Algorithm for Frequency Assignment Problems. In Proceedings of IMACS/IEEE International Symposium on Signal Processing, Robotics and Neural Networks (SPRANN '94), Lille, France, April, pp. 81-84.
18. Lai,W.K. and Coghill, G.G. (1996) Channel assignment through evolutionary optimization. IEEE Trans. Veh. Technol., 45, 91-96. (Pubitemid 126771073)
19. Castelino, D., Hurley, S. and Stephens, N.M. (1996) A tabu search algorithm for frequency assignment. Ann. Oper. Res., 63, 301-319. (Pubitemid 126729245)
20. 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. (Pubitemid 23615813)
21. Kunz, D. (1991) Channel assignment for cellular radio using neural networks. IEEE Trans. Veh. Technol., 40, 188-193.
22. Roberts, F.S. (1993) No-hole 2-distance colorings. Math. Comput. Model., 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. (2006) Real number channel assignments with distance conditions. SIAM J. Discrete Math., 20, 302-327. (Pubitemid 46785426)
25. Fiala, J. and Kratochvíl, J. (2001) Complexity of Partial Covers of Graphs. In Proceedings of International Symposium on Algorithms and Computation (ISAAC '01), Christchurch, New Zeland, December 19-21, Lectures Notes in Computer Science 2223, pp. 537-549. Springer, Berlin.
26. Fiala, J., Kratochvíl, J. and Proskurowski, A. (2001) Distance Constrained Labeling of Precolored Trees. In Proceedings of 7th Italian Conference on Theoretical Computer Science (ICTCS'01), Torino, Italy, October 4-6, Lectures Notes in Computer Science 2202, pp. 285-292. Springer, Berlin. (Pubitemid 33347491)
27. Chang, G.J. and Kuo, D. (1996) The L(2, 1)-labeling problem on graphs. SIAM J. Discrete Math., 9, 309-316.
28. Chang, G.J., Chen, J.-J., Kuo, D. and Liaw, S.-C. (2007) Distance-two labelings of digraphs. Discrete Appl.Math., 155, 1007-1013. (Pubitemid 46436157)
29. Yeh, R.K. and Li, C.-S. (1997) The edge span of the distance two labelling of graphs. Taiwanese J. Math., 4, 675-684.
30. 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. Kluwer, Boston.
31. Yeh, R.K. (2006) A survey on labeling graphs with a condition at distance two. Discrete Math., 306, 1217-1231. (Pubitemid 44208821)
32. Calamoneri, T. (2006) The L(h, k)-labelling problem: a survey and annotated bibliography. Comput. J., 49, 585-608. (Pubitemid 44592705)
33. Brandstadt, A., Le,V.B. and Spinrad, J.P. (1999) Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
34. Fotakis, D.A., Nikoletseas, S.E., Papadopoulou, V.G. and Spirakis, P.G. (2005) Radiocoloring in planar graphs: complexity and approximations. Theo. Comput. Sci., 340, 514-538. (Pubitemid 41162158)
35. McCormick, S.T. (1983) Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Program., 26, 153-171. (Pubitemid 13587149)
36. Sen, A. and Huson, M.L. (1997) A new model for scheduling packet radio networks. Wireless Netw., 3, 71-82. (Pubitemid 127506839)
37. Ramanathan, S. and Lloyd, E.L. (1992) The Complexity of Distance-2-coloring. In Proceedings of 4th International Conference of Computing and Information (ICCI '92), Toronto, Ontario, May 28-30, pp. 71-74. IEEE Computer Society Press.
38. Ramanathan, S. (1993) Scheduling algorithms for multi-hop radio networks. PhD Thesis, Dept. of Computer Science, University of Delaware, Newark.
39. Heggernes, P. and Telle, J.A. (1998) Partitioning graphs into generalized dominating sets. Nordic J. Comput., 5, 128-143.
40. Ramanathan, S. and Lloyd, E.L. (1993) Scheduling algorithms for multi-hop radio networks. IEEE/ACM Trans. Netw., 1, 166-172.
41. Fiala, J., Kloks, T. and Kratochvíl, J. (2001) Fixed-parameter complexity of a;-labelings. Discrete Appl. Math., 113, 59-72.
42. Bodlaender, H.L., Kloks, T., Tan, R.B. and van Leeuwen, J. (2004) Approximations for a;-colorings of graphs. Comput. J., 47, 193-204.
43. Eggemann, N., Havet, F. and Noble, S.D. (2010) k L(2, 1)-labelling for planar graphs is NP-complete for k ≥ 4. Discrete Appl. Math., 158, 1777-1788.
44. Fiala, J. and Kratochvíl, J. (2005) On the Computational Complexity of the L(2, 1)-labeling Problem for Regular Graphs. In Proceedings of 11th Italian Conference on Theoretical Computer Science (ICTCS'05), Siena, Italy, October 12-14, Lectures Notes in Computer Science 3701, pp. 228-236. Springer, Berlin.
45. Klavzar, M., Kratochvíl, J., Kratsch, D. and Liedloff, M. (2011) Exact Algorithms for L(2, 1)-Labelings of Graphs. In Proc. of 32nd Intl. Symp. on Mathematical Foundations of Computer Science (MFCS '07), Cesky Krumlov, Czech Republic, August 27-31, Lecture Notes in Computer Science 4708, pp. 513-524. Springer, Berlin.
46. Král', D. (2006) Channel assignment problem with variable weights. SIAM J. Discrete Math., 20, 690-704.
47. Havet, F., Klavzar, M., Kratochvíl, J., Kratsch, D. and Liedloff, M. (2011) Exact algorithms for L(2, 1)-labelings of graphs. Algorithmica, 59, pp. 169-194.
48. Junosza-Szaniawski, K. and Rzazewski, P. (2011) On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs. In Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), London, July 26-28, 2010, Lecture Notes in Computer Science 6460, pp. 34-37. Springer, Berlin.
49. Junosza-Szaniawski, K., Kratochvíl, J., Liedloff, M., Rossmanith, P. and Rz̧azewski, R. (2011) Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. In Proceedings of 8th Annual Conference on Theory and Applications of Models of Computation (TAMC2011),Tokio, Japan, 23-25 May 2011, Springer Lecture Notes in Computer Science 6648. Springer, Berlin (to appear).
50. Alon, N. and Mohar, B. (2002) The chromatic number of graph powers. Comb. Probab. Comput., 11, 1-10.
51. Nikoletseas, S., Papadopoulou, V. and Spirakis, P. (2003) Radiocoloring Graphs via the Probabilistic Method. In 4th Panhellenic Logic Symposium, Thessalonik, Greece, July 7-10, pp. 135-140.
52. Jonas, K. (1993) Graph coloring analogues with a condition at distance two: L(2, 1)-labelings and list a;-labelings. PhDThesis, University of South Carolina, Columbia.
53. Král', D. and Škrekovski, R. (2003)Atheorem about the channel assignment. SIAM J. Discrete Math., 16, 426-437.
54. Gonçalves, D. (2008) On the L(p, 1)-labeling of graphs. Discrete Math., 308, 1405-1414.
55. Havet, F., Reed, B. and Sereni, J.-S. (2008) L(2, 1)-Labeling of Graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA'08), San Francisco, CA, January 20-22, pp. 621-630.
56. Havet, F., Reed, B. and Sereni, J.-S. L(2, 1)-Labeling of graphs.Technical Report ITI Series. Charles University, Prague, Czech Republic, 2009-454. http://iti.mff.cuni.cz/en/series/2009/454.pdf. Journal version of [55]
57. 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.
58. Balakrishnan, H. and Deo, N. (2003) Parallel algorithm for radiocoloring a graph. Congres. Numer., 160, 193-204. (Pubitemid 38214492)
59. Nordhaus, E.A. and Gaddun, J.W. (1956) On complementary graphs. Am. Math. Monthly, 63, 175-177.
60. Chang, G.J. and Lu, C. (2003) Distance-two labelings of Graphs. Eur. J. Comb., 24(1), 53-58.
61. 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.
62. Georges, J.P. and Mauro, D.W. (1995) Generalized vertex labeling with a condition at distance two. Congres. Numer., 109, 141-159.
63. Calamoneri, T. and Vocca, P. (2004) Approximability of the L(h, k)-Labelling Problem. In Proceedings of 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), Le Mont Saint-Michel, France, May 24-26, Lecture Notes in Computer Science 3499, pp. 65-77. Springer, Berlin.
64. Halldórsson, M.M. (2006) Approximating the L(h, k)-labelling problem. Int. J. Mobile Netw. Design Innovat., 1, 113-117.
65. Halldórsson, M.M. (1993)A still better performance guarantee for approximate graph coloring. Inform. Process. Lett., 45, 19-23.
66. Makansi, T. (1987) Transmitter-oriented code assignment for multihop packet radio. IEEE Trans. Commun., 35, 1379-1382.
67. Battiti, R., Bertossi, A.A. and Bonuccelli, M.A. (1999) Assigning codes in wireless networks: bounds and scaling properties. Wireless Netw., 5, 195-209.
68. Kohl, A. (2006) Bounds for the L(d, 1)-number of diameter 2 graphs, trees and cacti. Int. J. Mobile Netw. Design Innovat., 1, 124-135.
69. Sen, A., Roxborough, T. and Medidi, S. (1998) Upper and Lower Bounds of a Class of Channel Assignmet Problems in Cellular Networks. In Proceedings of IEEE INFOCOM 1998, San Francisco, CA, March 29-April 2, Vol. 3, pp. 1273-1283. IEEE Computer Society Press.
70. Calamoneri, T. and Petreschi, R. (2004) L(h, 1)-labeling subclasses of planar graphs. J. Parallel Distrib. Comput., 64, 414-426.
71. Das, S.K., Finocchi, I. and Petreschi, R. (2006) Conflict-free star-access in parallel memory systems. J.Parallel Distrib. Syst., 66, 1431-1441. (Pubitemid 44528212)
72. Calamoneri, T. (2006) Exact solution of a class of frequency assignment problems in cellular networks and other regular grids. Discrete Math. Theor. Comput. Sci., 8, 141-158.
73. Calamoneri, T., Caminiti, S. and Fertin, G. (2006) L(h, k)-labelling of regular grids. Int. J. Mobile Netw. Design Innovat., 1, 92-101.
74. Griggs, J.R. and Jin, X. (2005) Optimal Channel Assignments for the Lattices with a Condition at Distance Two. In Proceedings of the 5th InternationalWorkshop on Algorithms forWireless, Mobile, Ad Hoc and Sensor Networks (W-MAN '05), Denver, Colorado, April 4-8, Vol. 13, pp. 238.1, IEEE Computer Society.
75. Dubhashi, A.N., Shashanka, M.V.S., S., Pati, A., Shashank R. and Shende, A.M. (2002) Channel Assignment for Wireless Networks Modelled as d-dimensional Square Grids. In Proceedings InternationalWorkshop on Distributed Computing (IWDC '02), Calcutta, India, December 28-31, Lecture Notes in Computer Science 2571, pp. 130-141. Springer, Berlin. (Pubitemid 36140661)
76. Fertin, G. and Raspaud, A. (2007) L(p, q) labeling of ddimensional grids. Discrete Math., 307, 2132-2140.
77. Whittlesey, M.A., Georges, J.P. and Mauro, D.W. (1995) On the a; number of Qn and related graphs. SIAM J. Discrete Math., 8, 499-506.
78. Jha, P.K. Narayanan, A., Sood, P., Sundaran, K. and Sunder, V. (2000) On L(2, 1)-labeling of the Cartesian product of a cycle and a path. Ars Comb., 55, 81-89.
79. Klavzar, 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.
80. Kuo, D. andYan, J.-H. (2004) On L(2, 1)-labelings of Cartesian products of paths and cycles. Discrete Math., 283, 137-144.
81. Schwarz, C. and Sakai Troxell, D. (2006) L(2, 1)-labelings of products of two cycles. Discrete Appl. Math., 154, 1522-1540.
82. 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. (Pubitemid 33701237)
83. 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 Fund. Theory Appl., 47, 1531-1534. (Pubitemid 33777859)
84. Jha, P.K. (2001) Optimal L(2, 1)-labeling of strong Cartesian products of cycles. IEEE Trans. Circ. Syst. I: Fund. Theory Appl., 48, 498-500. (Pubitemid 32471062)
85. Korže, D. and Vesel, A (2005) L(2, 1)-labeling of strong products of cycles. Inform. Process. Lett., 94, 183-190.
86. Jha, P.K., Klavzar, S. and Vesel, A. (2005) L(2, 1)-labeling of direct product of paths and cycles. Discrete Appl. Math., 145, 317-325.
87. 2-conjecture for L(2, 1)-labelings is true for directed and strong products of graphs. IEEE Trans. Circuits Syst. II, 53, 274-277. (Pubitemid 46511168)
88. 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.
89. Shao, Z., Klavžar, S., Shiu,W.C. and Zhang, D. (2008) Improved bounds on the l(2, 1)-number of direct and strong products of graphs. IEEE Trans. Circuits Syst. II, 55(7), 685-689.
90. Shao, Z. and Solis-Oba, R. (2010) L(2, 1)-labelings on the composition of n graphs. Theor. Comput. Sci., 411, 3287-3292.
91. Jha, P.K., Klavzar, S. and Vesel, A. (2005) Optimal L(d, 1)-labelings of directed products of cycles and Cartesian products of cycles. Discrete Appl. Math., 152, 257-265. (Pubitemid 41427510)
92. Georges, J.P. and Mauro, D.W. (1999) Some results on a; j k-numbers of the products of complete graphs. Congres. Numer., 140, 141-160.
93. Erwin, D.J., Georges, J.P. and Mauro, D.W. (2003) On Labeling the vertices of products of complete graphs with distance constraints. Nav. Res. Logist., 52, 138-141.
94. Huang, L.-H. and Chang, G.J. (2009) L(h, k)-labelings of Hamming graphs. Discrete Math., 309, 2197-2201.
95. Chiang, S.-H., Yan, J.-H. (2008) On L(d, 1)-Labeling of Cartesian products of a cycle and a path. Discrete Appl. Math., 156, 2867-2881.
96. Haque, E. and Jha, P.K. (2008) L(j, k)-Labelings of Kronecker products of complete graphs. IEEE Trans. Circuits Syst. II, 55, 70-73.
97. Kohl, A. (2009) The L(d, 1)-number of powers of paths. Discrete Math., 309, 3427-3430.
98. Hasunama, T., Ishii, T., Ono, H. and Uno,Y. (2009)An O(n1.75) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci., 410, 3702-3710.
99. Hasunuma, T., Ishii, T., Ono, H. and Uno, Y. (2009) A Linear Time Algorithm for L(2, 1)-labeling of Trees. In Proceedings 17th Annual European Symposium on Algorithms (ESA'09), Copenhagen, Denmark, Lecture Notes in Computer Science 5757, pp. 35-46. Springer, Berlin.
100. Wang, W.-F. (2007) The L(2, 1)-labelling of trees. Discrete Appl. Math., 154, 598-603.
101. Fiala, J., Golovach, P.A. and Kratochvíl, J. (2008) Computational Complexity of the Distance Constrained Labeling Problem for Trees. In 35th International Colloquium on Automata, Languages and Programming (ICALP'08), Reykjavik, Iceland, July 6-13, Lectures Notes in Computer Science 5125, pp. 294-305. Springer, Berlin.
102. Welsh, D. (1999) Private communication with J. Fiala, J. Kratochvíl and A. Proskurowski.
103. Fiala, J., Kratochvíl, J. and Proskurowski, A. (2005) Systems of distant representatives. Discrete Appl. Math., 145, 306-316.
104. Fiala, J., Golovach, P.A. and Kratochvíl, J. (2008) Distance Constrained Labeling of Trees. In 5th International Conference on Theory and Applications of Models of Computation (TAMC '08), Xian, China, April 25-29, Lectures Notes in Computer Science 4978, pp. 125-135. Springer, Berlin.
105. Georges, J.P. and Mauro, D.W. (2003) Labeling trees with a condition at distance two. Discrete Math., 269, 127-148.
106. Calamoneri, T., Pelc, A. and Petreschi, R. (2006) Labeling trees with a condition at distance two. Discrete Math., 306, 1534-1539. (Pubitemid 43974758)
107. Juan, J.S.-T., Liu, D.D.-F. and Chen, L.-Y. (2010) L(j, k)-labelling and maximum ordering-degrees for trees. Discrete Appl. Math., 158, 692-698.
108. Kobler, D. and Rotics, U. (2003) Polynomial algorithms for partitioning problems on graphs with fixed clique-width. Theor. Comput. Sci., 299, 719-734.
109. Suchan, K. and Todinca, I. (2007) On powers of graphs of bounded NLC-width (clique-width). Discrete Appl. Math.,155, 1885-1893. (Pubitemid 47212512)
110. Bodlaender, H.L. and Kratsch, D. Private communication with Todinca, I.
111. Corneil, D.G., Perl, Y. and Stewart, L.K. (1985) A linear recognition algorithm for cographs. SIAM J. Comput., 14, 926-934.
112. Courcelle, B., Makowsky, J. A., and Rotics, U. (2000) Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst., 33, pp. 125-150.
113. Courcelle, B. and Olariu, S. (2000) Upper bounds to the cliquewidth of graphs. Discrete Appl. Math., 101, pp. 77-114.
114. Bodlaender, H.L. (1998) A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci., 209, 1-45. (Pubitemid 128450429)
115. Reed, B. A. (2003) Algorithmic Aspects of Treewidth. In Reed, B.A. and Sales, C.L. (eds.), Recent Advances in Algorithms and Combinatorics. Springer, Berlin.
116. Report of the Project. Critical Resource Sharing for Cooperation in Complex Systems (Crescco) funded by the European Community under the "Information Society Technologies" Programme (1998-2002), Technical Report IST-2001-33135.
117. Fiala, J. and Kratochvíl, J. (2005) Private communication.
118. Fiala, J., Golovach, P.A. and Kratochvíl, J. (2005) Distance Constrained Labeling of Graphs of Bounded Treewidth. In 32th International Colloquium on Automata, Languages and Programming (ICALP'05), Lisboa, Portugal, July 11-15, Lectures Notes in Computer Science 3580, pp. 360-372. Springer, Berlin. (Pubitemid 41436115)
119. 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.
120. Krumke, S.O., Marathe, M.V. and Ravi, S.S. (2001) Models and approximation algorithms for channel assignment in radio networks. Wireless Netw., 7, 575-584. (Pubitemid 33091055)
121. Fiala, J., Golovach, P.A. and Kratochvíl, J. (2011) Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412, 2513-2523.
122. Thomassen, C. (2001) Applications of Tutte cycles. Technical Report MAT 2001-16, Technical University of Denmark, Copenhagen.
123. Wan, P. J. (1997) Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Combin. Optim., 1, 179-186.
124. van den Heuvel, J. and McGuinnes, S. (2003) Colouring the square of a planar graphs. J. Graph Theory, 42, 110-124.
125. Agnarsson, G. and Halldórsson, M. (2003) Coloring powers of planar graphs. SIAM J. Discrete Math., 16, 654-662.
126. 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. Tech. Rep. London School of Economics, London, 2002. Translated and adapted from Diskretn. Anal. Issled. Oper. Ser., 1, 9-33 (in russian).
127. Molloy, M. and Salavatipour, M.R. (2005) A bound on the chromatic number of the square of a planar graph. J. Combin. Theory (Series B), 94, 189-213. (Pubitemid 40800801)
128. Jendrol', S and Voss, H.-J. (2004) Light subgraphs of graphs embedded in the plane and in the projective plane-a survey. IM Preprint series A, No 1/2004, Pavol Jozef Šafárik Univ., Slovakia.
129. Wang,W.-F. and Lih, K.-W. (2003) Labeling planar graphs with conditions on girth and distance two. SIAM J. Discrete Math., 17, 264-275.
130. Shao, Z. and Yeh, R.K. (2007) The L(2, 1)-labeling on planar graphs. Appl. Math. Lett., 20, 222-226.
131. Borodin, O.V., Glebow, A.N., Ivanova, A.O., Neustroeva, T.K. and Taskinov, V.A. (2004) Sufficient conditions for planar graphs to be 2-distance (δ+ 1)-colorable. Sib. Elektron. Mat. Izv, 1, 129-141 (in russian).
132. Borodin, O.V., Ivanova, A.O. and Neustroeva, T.K. (2004) 2-Distance coloring of sparse planar graphs. Sib. Elektron. Mat. Izv, 1, 76-90 (in russian).
133. Dvorák, Z., Král', D., Nejedlý, P. and Škrekovski, R. (2008) Coloring squares of planar graphs with girth 6. Eur. J. Combin., 29, 838-849.
134. Bella, P., Král, D., Mohar, B. and Quittnerová, K. (2007) Labeling planar graphs with a condition at distance two. Eur. J. Combin., 28, 2201-2239.
135. Dvorák, Z., Král', D., Nejedlý, P. and Škrekovski, R. (2009) Distance constrained labeling of planar graphs with no short cycles. Discrete Appl. Math., 157, 2634-2645.
136. Wang,W.-F. and Cai, L. (2008) Labelling planar graphs without 4-cycles with a condition at distance two. Discrete Appl. Math., 156, 2241-2249.
137. Bodlaender, H.L. (1988) Dynamic Programming on Graphs of Bounded Treewidth. In Proceedings of 15th International Colloquium on Automata, Languages and Programming (ICALP'88), Tampere, Finland, July 11-15, Lectures Notes in Computer Science 317, pp. 105-118. Springer, Berlin.
138. Agnarsson, G. and Halldórsson, M.M. (2004) On Colorings of Squares of Outerplanar Graphs. arXiv : 07061526v1. An earlier version appeared in Proceedings of 15th Annual ACMSIAM Symp. on Discrete Algorithms (SODA),NewOrleans, LA, January 11-13, pp. 242-253.
139. Wang,W.-F. and Luo, X.-F. (2009) Some results on distance two labellings of outerplanar graphs. Acta Math. Appl. Sin. (English Series), 25, 21-32.
140. Bruce, R.J. and Hoffmann, M. (2003) L(p, q)-labeling of Outerplanar Graphs. Tech. Rep. No. 2003/9, Department of Mathematics and Computer Science, University of Leicester, England.
141. Chartrand, G. and Harary, F. (1967) Planar permutation graphs. Ann. Inst. H. Poincaré, sect. B(N.S.), 3, 433-438.
142. Lih, K.-W.,Wang,W.-F. and Zhu, X. (2003) Coloring the square of K4-minor free graph. Discrete Math., 269, 303-309.
143. Wang,W.-F. andWang,Y. (2006) L(p, q)-labelling ofK4-minor free graphs. Inform. Process. Lett., 98, 169-173.
144. Král', D. and Nejedlý, P. (2009) Distance constrained labelings of K4-minor free graphs. Discrete Math., 309, 5745-5756.
145. Breu, H. and Kirkpatrick, D.G. (1998) Unit disk graph recognition is NP-hard. Comput. Geometry Theory Appl., 9, 3-24. (Pubitemid 128378346)
146. Hlinený, P. and Kratochvíl, J. (2001) Representing graphs by disks and balls (a survey of recognition complexity results). Discrete Math., 229, 101-124. (Pubitemid 33673574)
147. 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.
148. Sen, A. and Malesinska, E. (1997) Approximation Algorithms for Radio Network Schedulings. In Proceedings 35th Allerton Conference on Communication, Control and Computing, Allerton, IL, pp. 573-582.
149. Ma, X. and Loyd, E.L. (1999) Private communication with Krumke, S.O., Marathe, M.V. and Ravi, S.S.
150. Wan, P.-J. Conflict-free channel assignment in wireless ad hoc networks. Lecture 9 of course 'Wireless Networking' at Illinois Institute of Technology.
151. Fiala, J., Fishkin, A.V. and Fomin, F.V. (2004) On distance constrained labeling of disk graphs. Theor. Comput. Sci., 326, 261-292.
152. Shao, Z., Yeh, R.K., Shiu, W.C. (2008) The L(2, 1)-labeling of K1,n-free graphs and its applications. Appl. Math. Lett., 21, 1188-1193.
153. Agnarsson, G., Greenlaw, R. and Halldórsson, M.M. (2000) On powers of chordal graphs and their colorings. Congres. Numer., 144, 41-65.
154. Sakai, D. (1994) Labeling chordal graphs: distance two condition. SIAM J. Discrete Math., 7, 133-140.
155. Král', D. (2005) Coloring powers of chordal graphs. SIAM J. Discrete Math., 18, 451-461.
156. Panda, B.S. and Goel, P. (2010) L(2, 1)-labeling of perfect elimination bipartite graphs. Discrete Appl. Math., doi:10.1016/j.dam.2010.07.008.
157. Panda, B.S. and Goel, P. (2009) L(2, 1)-labeling of block graphs. Ars Combin. http://web.iitd.ac.in/~bspanda/publications.html.
158. Bonomo, F. and Cerioli, M.R. (2011) On the L(2, 1)-labeling of block graphs. Int. J. Comput. Math., 88, 468-475.
159. Raychauduri, A. (1987) On powers of interval and unit interval graphs. Congres. Numer., 59, 235-242.
160. Bertossi, A.A., Pinotti, C.M. and Rizzi, R. (2003) Channel Assignment on Strongly-Simplicial Graphs. In Proceedings of 3rd International Workshop on Wireless, Mobile and Ad Hoc Networks, (W-MAN 2003), Nice, France, April 22-26. IEEE Computer Society Press.
161. Calamoneri, T., Caminiti, S., Olariu, S. and Petreschi, R. (2009) On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. Networks, 53, 27-34.
162. Araki, T. (2009) Labeling bipartite permutation graphs with a condition at distance two. Discrete Appl. Math., 157, 1677-1686.
163. Jonas, K. Private communications to J.R. Griggs.
164. Frieder, O., Harary, F. andWan, P.-J. (2002)A radio coloring of a hypercube. Int. J. Comput. Math., 79, 665-670. (Pubitemid 41716723)
165. Calamoneri, T., Caminiti, S. and Petreschi, R. (2008)A general approach to L(h, k)-label interconnection networks. J. Comput. Sci. Technol., 23, 652-659.
166. Zhou, S. (2006) Labelling Cayley graphs on abelian groups. SIAM J. Discrete Math., 19, 985-1003.
167. Erdös, P., Fajtlowicz, S. and Hoffman, A.J. (1980) Maximum degree in graphs of diameter 2. Networks, 10, 87-90.
168. Junker, M. (2003) Moore Graphs, Latin Squares and Outer Automorphisms. Tech. Rep. Albert Ludwigs Univ. Freiburg, Germany.
169. Georges, J.P. and Mauro., D.W. (2003) On regular graphs optimally labeled with a condition at distance two. SIAM J. Discrete Math., 17, 320-331.
170. Costa, M.-C., de Werra, D., Picouleau, C. and Ries, B. (2009) Graph coloring with cardinality constraints on the neighborhood. Discrete Optim., 6, 362-369.
171. Griggs, J.R. and Jin, X. (2007) Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. J. Combin. Optim., 14, 249-257. (Pubitemid 47290624)
172. Bahes, P. (2010) Channel assignment on Cayley graphs. J. Graph Theory (to appear).
173. Mahadev, N.V.R. and Peled, U.N. (1995) Threshold graphs and related topics. Ann. Discrete Math., 56. Elsevier, Amsterdam.
174. Marchioro, P., Morgana, A., Petreschi, R. and Simeone, B. (1984) Degree sequences of matrogenic graphs. Discrete Math., 51, 47-61.
175. Foldes, S. and Hammer, P. (1978) On a class of matroid producing graphs. Colloq. Math. Soc. J. Bolyai (Combinatorics), 18, 331-352.
176. Peled, U.N. (1977) Matroidal graphs. Discrete Math., 20, 263-286.
177. Calamoneri, T. and Petreschi, R. (2006) a;-coloring matrogenic graphs. Discrete Appl. Math., 154, 2445-2457.
178. Calamoneri, T. and Petreschi, R. (2011) L(2, 1)-labeling of unigraphs. Discrete Appl. Math. (to appear).
179. Georges, J.P. and Mauro, D.W. (2002) On generalized Petersen graphs labeled with a condition at distance two. Discrete Math., 259, 311-318.
180. Adams, S.S., Cass, J. and Sakai Troxell, D. (2006)An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs. IEEE Trans. Circuits Syst. I, 53, 1101-1107.
181. Adams, S.S., Cass, J., Tesch, M., Sakai Troxell, D. and Wheeland, C. (2007) The minimum span of L(2, 1)-labelings of certain generalized petersen graphs. Discrete Appl. Math., 155, 1314-1325. (Pubitemid 46602576)
182. Adams, S.S., Booth, P., Jaffe, H., Sakai Troxell, D. and Zinnen, S.L. (2010) Exact a;-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips. Manuscript.
183. Damaschke, P. (1992) Distance in cocomparability graphs and their powers. Discrete Appl. Math., 35, 67-72.
184. Gravier, S., Klavzar, S. and Mollard, M. (2005) Codes and L(2, 1)-labelings in Sierpínski graphs. Taiwanese J. Math., 9, 671-681.