Fixed-parameter complexity of λ -labelings

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

Volumn 1665, Issue , 1999, Pages 350-363

  Fiala, Jiří ^a   Kloks, Ton ^b   Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

ADJACENT VERTICES; FIXED-PARAMETER COMPLEXITY; HARDNESS RESULT; LABELINGS; MINIMUM VALUE; NP COMPLETE; POSITIVE INTEGERS; SPARSE GRAPHS;

TREES (MATHEMATICS);

EID: 84947749416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46784-x_33     Document Type: Conference Paper

References (10)

1. Abello J., M.R. Fellows and J.C. Stillwell, On the complexity and combinatorics of covering finite complexes, Australasian Journal of Combinatorics 4 (1991), 103-112 351
2. Brandstädt, Andreas, Special graph classes-A survey, Schriftenreihe des Fachsbereichs Mathematik, SM-DU-199 (1991), Universität Duisburg Gesamthochschule. 352
3. Chang, G. J. and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Disc. Math. 9, (1996), pp. 309-316. 352, 353
4. Griggs, J. R. and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Disc. Math. 5, (1992), pp. 586-595. 350, 353, 356
5. Kratochvíl, Jan, Regular codes in regular graphs are difficult, Discrete Math. 133 (1994), 191-205 351
6. Kratochvíl, Jan, Andrzej Proskurowski, and Jan Arne Telle, Covering regular graphs Journal of Combin. Theory Ser. B 71 (1997), 1-16 351
7. Kratochvíl, Jan, Andrzej Proskurowski, and Jan Arne Telle, Covering directed multigraphs I. Colored directed multigraphs, In: Graph-Theoretical Concepts in Computer Science, Proceedings 23rd WG’97, Berlin, Lecture Notes in Computer Science 1335, Springer Verlag, (1997), pp. 242-257. 351, 352
8. Kratoch Í, Jan, Andrzej Proskurowski, and Jan Arne Telle, Complexity of graph covering problems Nordic Journal of Computing 5 (1998), 173-195 351
9. Liu, D. D.-F. and R. K. Yeh, On distance two labellings of graphs, ARS Combinatorica 47, (1997), pp. 13-22. 351
10. Yeh, Kwan-Ching, Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina, 1990. 350, 351