On the computational complexity of the L (2,1)-labeling problem for regular graphs

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

Volumn 3701 LNCS, Issue , 2005, Pages 228-236

  Fiala, Jiří ^a   Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

K-REGULAR GRAPH; LABELING PROBLEM;

COMPUTATIONAL COMPLEXITY; DECISION MAKING; PROBLEM SOLVING;

GRAPH THEORY;

EID: 33646180600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_19     Document Type: Conference Paper

References (12)

1. CALAMONERI, T. The L(h, k)-labeling probelm: a survey. Tech. Rep. 04/2004, Dept. of Comp. Sci, Univ, of Rome - "La Sapienza", 2004.
2. FIALA, J., AND KRATOCHVÍL, J. Partial covers of graphs. Discussiones Mathematicae Graph Theory 22 (2002), 89-99.
3. FIALA, J., KRATOCHVÍL, J., AND KLOKS, T. Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113, 1 (2001), 59-72.
4. GAREY, M. R., AND JOHNSON, D. S. Computers and Intractability. W. H. Freeman and Co., New York, 1979.
5. GEORGES, J. P., AND MAURO, D. W. On regular graphs optimally labeled with a condition at distance two. SIAM Journal of Discrete Mathematics 17, 2 (2003), 320-331.
6. GRIGGS, J. R., AND YEH, R. K. Labelling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics 5, 4 (1992), 586-595.
7. HALE, W. K. Frequency assignment: Theory and applications. Proc. of the IEEE 68, 12 (1980), 1497-1514.
8. KRÁL', D. Coloring powers of chordal graphs. SIAM J. Discrete Math. 18, 3 (2004), 451-461.
9. KRÁL', D., AND ŠKREKOVSKI, R. A theorem about the channel assignment problem. SIAM J. Discrete Math. 16, 3 (2003), 426-437.
10. KRATOCHVÍL, J., PROSKUROWSKI, A., AND TELLE, J. A. Covering regular graphs. Journal of Combinatorial Theory B 71, 1 (Sept 1997), 1-16.
11. SAKAI, D. Labeling chordal graphs: distance two condition. SIAM Journal of Discrete Mathematics 7, 1 (1994), 133-140.
12. SCHAEFER, T. J. The complexity of the satisfability problem. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (1978), ACM, pp. 216-226.