L(p,q)-labelling of K4-minor free graphs

Information Processing Letters

Volumn 98, Issue 5, 2006, Pages 169-173

  Wang, Weifan ^a   Wang, Yiqiao ^a  

^a ZHEJIANG NORMAL UNIVERSITY   (China)

Author keywords

Channel assignment; Distance; K4 minor free graph; L(p,q) labelling

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING;

CHANNEL ASSIGNMENT; DISTANCE; K4-MINOR FREE GRAPH; L(P,Q)-LABELLING;

DATA PROCESSING;

EID: 33645082501     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.02.005     Document Type: Article

References (13)

1. G.J. Chang, and D. Guo The L (2, 1 ) -labeling problem on graphs SIAM J. Discrete Math. 9 1996 309 316
2. R.J. Duffin Topology of series-parallel networks J. Math. Anal. Appl. 10 1965 303 318
3. D. Gonçalves On the L (p, 1 ) -labelling of graphs Discrete Math. Theoret. Comput. Sci. AE 2005 81 86
4. J.R. Griggs, and R.K. Yeh Labelling graphs with a condition at distance 2 SIAM J. Discrete Math. 5 1992 586 595
5. W.K. Hale Frequency assignment: theory and applications Proc. IEEE 68 1980 1497 1514
6. J. van den Heuvel, and S. McGuinness Coloring the square of a planar graph J. Graph Theory 42 2003 110 124
7. K.W. Lih, W.F. Wang, and X. Zhu Coloring the square of K 4 -minor free graph Discrete Math. 269 2003 303 309
8. D. Král, and R. Škrekovski A theorem about the channel assignment problem SIAM J. Discrete Math. 16 2003 426 437
9. M. Molloy, and M.R. Salavatipour A bound on the chromatic number of the square of a planar graph J. Combin. Theory Ser. B 94 2005 189 213
10. C. Thomassen, Applications of Tutte cycles, Technical Report, Technical University of Denmark, 2001
11. W.F. Wang, and K.W. Lih Labelling planar graphs with conditions on girth and distance two SIAM J. Discrete Math. 17 2004 264 275
12. W.F. Wang, K.W. Lih, Note on coloring the square of an outerplanar graph, Ars Combin., submitted for publication
13. G. Wegner, Graphs with given diameter and a coloring problem, Preprint, University of Dortmund, 1977