On the L (p, 1)-labelling of graphs

Discrete Mathematics

Volumn 308, Issue 8, 2008, Pages 1405-1414

  Goncalves D ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Channel assignment problem; L (p, q) labelling

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

CHANNEL ASSIGNMENT PROBLEM; THEORETIC FRAMEWORK;

GRAPH THEORY;

EID: 38749091312     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.07.075     Document Type: Article

References (15)

1. P. Bella, D. Král, B. Mohar, K. Quittnerová, Labeling planar graphs with a condition at distance two, Discrete Math. Theor. Comput. Sci. AE (2005), 41-44.
2. Chang G.J., and Kuo D. The L(2,1)-labeling problem on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
3. Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., and Yeh R.K. On L(d, 1)-labelings of graphs. Discrete Math. 220 (2002) 57-66
4. G. Fertin, A. Raspaud, L(p,q) Labeling of d-dimensional girds, Discrete Math. 307 (16) (2007) 2132-2140.
5. Fiala J., Fishkin A.V., and Fomin F.V. On distance constrained labeling of disk graphs. Theoret. Comput. Sci. 326 (2004) 261-292
6. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
7. van den Heuvel J., and McGuinness S. Coloring the square of a planar graph. J. Graph Theory 42 2 (2003) 110-124
8. J.-H Kang, L(2,1)-labelling of 3-regular Hamiltonian cubic graphs, preprint.
9. Král D. Coloring powers of chordal graphs. SIAM J. Discrete Math. 18 3 (2004) 451-461
10. Král D., and Škrekovski R. A theorem about the channel assignment problem. SIAM J. Discrete Math. 16 3 (2003) 426-437
11. McDiarmid C. On the span in channel assignment problem: bounds. computing and counting, Discrete Math. 266 (2003) 387-397
12. M. Molloy, B. Reed, Graph colouring and the probabilistic method, Algorithms and Combinatorics, vol. 23, Springer, Berlin, 2002.
13. Molloy M., and Salavatipour M.R. A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B 94 2 (2005) 189-213
14. Sakai D. Labeling chordal graphs: distance two condition. SIAM J. Discrete Math. 7 (1994) 133-140
15. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506