Exact algorithms for L (2,1)-labeling of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4708 LNCS, Issue , 2007, Pages 513-524

  Kratochvíl, Jan ^a   Kratsch, Dieter ^b   Liedloff, Mathieu ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING;

ADJACENT VERTICES; FREQUENCY ASSIGNMENT PROBLEM; GRAPH LABELINGS;

GRAPH THEORY;

EID: 38049073784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74456-6_46     Document Type: Conference Paper

References (15)

1. Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for lambda-Colorings of Graphs. Computer Journal 47, 193-204 (2004)
2. Chang, G.J., Kuo, D.: The L(2, 1)-labeling problem on graphs. SIAM Journal of Discrete Mathematics 9, 309-316 (1996)
3. Fiala, J., Golovach, P., Kratochvíl, J.: Distance Constrained Labelings of Graphs of Bounded Treewidth. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 360-372. Springer, Heidelberg (2005)
4. Fiala, J., Kloks, T., Kratochvíl, J.: Fixed-parameter complexity of A-labelings. Discrete Applied Mathematics 113, 59-72 (2001)
5. Fiala, J., Kratochvíl, J.: Complexity of partial covers of graphs. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 537-549. Springer, Heidelberg (2001)
6. Fiala, J., Kratochvíl, J.: Partial covers of graphs. Mathematicae Graph Theory 22, 89-99 (2002)
7. Fiala, J., Kratochvíl, J., Pór, A.: On the computational complexity of partial covers of theta graphs. Electronic Notes in Discrete Mathematics 19, 79-85 (2005)
8. Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: Domination - A case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 192-203. Springer, Heidelberg (2005)
9. Fomin, F., Heggernes, P., Kratsch, D.: Exact algorithms for graph homomorphisms. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 161-171. Springer, Heidelberg (2005)
10. Gonçalves, D.: On the L(p, 1)-labelling of graphs. In: DMTCS Proceedings, vol. AE, pp. 81-86
11. Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics 5, 586-595 (1992)
12. Hell, P., Nešetřil, J.: On the complexity of H-colouring. Journal of Combinatorial Theory Series B 48, 92-110 (1990)
13. Leese, R.A., Noble, S.D.: Cyclic labellings with constraints at two distances. Electronic Journal of Combinatorics, Research paper 16, 11, (2004)
14. Liu, D., Zhu, X.: Circular Distance Two Labelings and Circular Chromatic Numbers. Ars Combinatoria 69, 177-183 (2003)
15. Roberts, F.S.: Private communication to J. Griggs