K-L(2,1)-labelling for planar graphs is NP-complete for k< 4

Discrete Applied Mathematics

Volumn 158, Issue 16, 2010, Pages 1777-1788

  Eggemann, Nicole ^a   Havet, Frédéric ^b,c   Noble, Steven D ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

^c INRIA   (France)

Author keywords

Frequency assignment problem; L(2,1) labelling; NP complete; Planar graph

Indexed keywords

ADJACENT VERTICES; FREQUENCY ASSIGNMENT PROBLEM; GRAPH G; L(2,1)-LABELLING; NP COMPLETE; NP COMPLETE PROBLEMS; PERFECT MATCHINGS; PLANAR GRAPH; VERTEX SET;

COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; POLYNOMIALS; TRAVELING SALESMAN PROBLEM;

GRAPH THEORY;

EID: 77956173920     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.06.016     Document Type: Article

References (23)

1. P. Bella, D. Krl', B. Mohar, and K. Quittnerov Labeling planar graphs with a condition at distance two European J. Combin. 28 2007 2201 2239
2. H.L. Bodlaender, T. Kloks, R.B. Tan, and J. van Leeuwen Approximations for λ-colorings of graphs Computer J. 47 2004 193 204
3. T. Calamoneri The L (h, k ) -labelling problem: a survey and annotated bibliography Computer J. 49 2006 585 608
4. T. Calamoneri, and R. Petreschi L (h, 1 ) -labeling subclasses of planar graphs J. Parallel and Distributed Comput. 64 2004 414 426
5. G.J. Chang, and D. Kuo The L (2, 1 ) -labeling problem on graphs SIAM J. Discrete Math. 9 1996 309 316
6. J. Fiala, P. Golovach, J. Kratochvl, Distance constrained labelings of graphs of bounded treewidth, in: Proceedings of ICALP 2005, in: Lecture Notes in Computer Science, vol. 3580, 2005, pp. 360372.
7. J. Fiala, T. Kloks, and J. Kratochvl Fixed-parameter complexity of λ-labelings Discrete Appl. Math. 113 2001 59 72
8. D. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou, and P.G. Spirakis NP-completeness results and efficient approximations for radiocoloring in planar graphs Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science Lecture Notes In Computer Science vol. 1893 2000 Springer 363 372
9. D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou, and P.G. Spirakis Radiocoloring in planar graphs: complexity and approximations Theoret. Comput. Sci. 340 2005 514 538
10. J.R. Griggs, and R.K. Yeh Labeling graphs with a condition at distance 2 SIAM J. Discrete Math. 5 1992 586 595
11. T. Hasunuma, T. Ishii, H. Ono, and Y. Uno A linear time algorithm for L (2, 1 ) -labeling of trees Algorithms ESA 2009 Lecture Notes in Computer Science vol. 5757 2009 Springer 35 46
12. T. Hasunuma, T. Ishii, H. Ono, and Y. Uno An O (n 1.75 ) algorithm for L (2, 1 ) -labeling of trees Theoret. Comput. Sci. 410 2009 3702 3710
13. F. Havet, J. van den Heuvel, C. McDiarmid, and B. Reed List colouring squares of planar graphs Electron. Notes in Discrete Math. 29 2007 515 519
14. F. Havet, J. van den Heuvel, C. McDiarmid, B. Reed, List colouring squares of planar graphs, preprint, 2008.
15. F. Havet, B. Reed, J.-S. Sereni, L (2, 1 ) -labelling of graphs, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithm, SODA 2008, 2008, pp. 621630.
16. F. Havet, and S. Thomass Complexity of (p, 1 ) -total labelling Discrete Appl. Math. 157 2009 2859 2870
17. J. van den Heuvel, and S. McGuiness Colouring the square of a planar graph J. Graph Theory 42 2003 110 124
18. A.E. Koller, The frequency assignment problem, Ph.D. Thesis, Brunel University, 2005.
19. A.E. Koller, S.D. Noble, A. Yeo, Computing the minimum span of an L (2, 1 ) -labelling of an outerplanar graph (in preparation).
20. F.S. Roberts, Private communication to J. Griggs.
21. T.J. Schaefer The complexity of satisfiability problems Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, Annual ACM Symposium on Theory of Computing 1978 ACM 216 226
22. G. Wegner, Graphs with given diameter and a coloring problem, Technical Report, University of Dortmund, 1977.
23. R.K. Yeh A survey on labeling graphs with a condition at distance two Discrete Math. 306 2006 1217 1231