Labelings of graphs with fixed and variable edge-weights

SIAM Journal on Discrete Mathematics

Volumn 21, Issue 3, 2007, Pages 688-706

  Babilon, Robert ^a   Jelinek V I T ^a   Král, Daniel ^a   Valtr, Pavel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Channel assignment problem; Graph labeling with distance conditions

Indexed keywords

GRAPH THEORY; LABELS;

CHANNEL ASSIGNMENT PROBLEM; EDGE-WEIGHTS; GRAPH G; GRAPH LABELING WITH DISTANCE CONDITIONS; OF GRAPHS; TWO TYPES;

LABELING;

EID: 47049107905     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/040619545     Document Type: Article

References (30)

1. G. AGNARSSON, R. GREENLAW, AND M. M. HALLDÓRSSON, Powers of chordal graphs and their coloring, Proceedings of the Thirty-First South Eastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 2000) Congr. Numer., 144 (2000), pp. 41-65.
2. T. M. APÓSTOL, Modular Functions and Dirichlet Series in Number Theory, Springer-Verlag, New York, 1997.
3. H. L. BODLAENDER, T. KLOKS, R. B. TAN, AND J. VAN LEEUWEN, λ-coloring of graphs, in Proc. STACS'00, G. Goos, J. Hartmanis, and J. van Leeuwen, eds., Lecture Notes in Comput. Sci. 1770, Springer-Verlag, Berlin, 2000, pp. 395-406.
4. G. J. CHANG, W.-T. KE, D. D.-F. LIU, AND R. K. YEH, On L(d, 1)-labelings of graphs, Discrete Math., 220 (2000), pp. 57-66.
5. G. J. CHANG AND D. KUO, The L(2, l)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
6. J. H. CONWAY AND R. K. GUY, The Book of Numbers, Springer-Verlag, Berlin, 1996.
7. J. FIALA, J. KRATOCHVÍL, AND T. KLOKS, Fixed-parameter complexity of λ-labelings, Discrete Appl. Math., 113 (2001), pp. 59-72.
8. D. A. FOTAKIS, S. E. NIKOLETSEAS, V. G. PAPADOPOULOU, AND P. G. SPIRAKIS, NP-completeness results and efficient approximations for radiocoloring in planar graphs, in Mathematical Foundations of Computer Science 2000 (Bratislava), Lecture Notes in Comput. Sci. 1893, B. Rovan, ed., Springer-Verlag, Berlin, 2000, pp. 363-372.
9. D. GONÇALVES, On the L(p, 1)-labelling of graphs, Discrete Math. Theoret. Comput. Sci., AE (2005), pp. 81-86.
10. R. L. GRAHAM, D. E. KNUTH, AND O. PATASHNIK, Concrete Mathematics: A Foundation for Computer Science, 2nd ed., Addison-Wesley, Reading, MA, 1994.
11. J. R. GRIGGS AND T. X. JIN, Real number graph labellings with distance conditions, SIAM J. Discrete Math., 20 (2006), pp. 302-327.
12. J. R. GRIGGS AND T. X. JIN, Real Number Graph Labellings of Paths and Cycles, in preparation.
13. J. R. GRIGGS AND T. X. JIN, Real Number Graph Labellings of Infinite Graphs, in preparation.
14. J. R. GRIGGS AND D. KRÁL', Graph Labellings with Variable Weights: A Survey, Discrete Appl. Math., to appear.
15. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
16. W. K. HALE, Frequency assignment: Theory and applications, Proceedings of the IEEE, 68 (1980), pp. 1497-1514.
17. G. H. HARDY AND E. M. WRIGHT, An Introduction to the Theory of Numbers, Clarendon Press, New York, 1979.
18. T. X. JIN, Ph.D. thesis, University of South Carolina, Columbia, SC, in preparation.
19. J.-H. KANG, L(2, l)-labeling of 3-regular Hamiltonian graphs, submitted.
20. J.-H. KANG, L(2, 1)-Labelling of 3-Regular Hamiltonian Graphs, Ph.D. thesis, University of Illinois, Urbana-Champaign, IL, 2004.
21. D. KRÁL', An exact algorithm for channel assignment problem, Discrete Appl. Math., 145 (2005), pp. 326-331.
22. D. KRÁL', Coloring powers of chordal graphs, SIAM J. Discrete Math., 18 (2004), pp. 451-461.
23. D. KRÁL', The channel assignment problem with variable weights, SIAM J. Discrete Math., 20 (2006), pp. 690-704.
24. D. KRÁL' AND R. ŠKREKOVSKI, A theorem about channel assignment problem, SIAM J. Discrete Math., 16 (2003), pp. 426-437.
25. R. A. LEESE AND S. D. NOBLE, Cyclic labellings with constraints at two distances, Electron. J. Combin., 11 (2004), Research Paper #16.
26. C. MCDIARMID, Discrete mathematics and radio channel assignment, in Recent Advances in Algorithms and Combinatorics CMS Books Math., C. Linhares-Salas and B. Reed, eds., Ouvrages Math. SMC 11, Springer, New York, 2003, pp. 27-63.
27. C. MCDIARMID, On the span in channel assignment problems: Bounds, computing and counting, Discrete Math., 266 (2003), pp. 387-397.
28. D. SAKAI, Labeling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.
29. I. VARDI, Computational Recreations in Mathematica, Addison-Wesley, Redwood City, CA, 1991.
30. E. W. WEISSTEIN, Farey Sequence, http://mathworld. wolfram.com/FareySequence.html.