Labeling bipartite permutation graphs with a condition at distance two

Discrete Applied Mathematics

Volumn 157, Issue 8, 2009, Pages 1677-1686

  Araki, Toru ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

Biclique; Bipartite permutation graph; Channel assignment; Distance two labeling; L (p, q) labeling

Indexed keywords

BICLIQUE; BIPARTITE PERMUTATION GRAPH; CHANNEL ASSIGNMENT; DISTANCE TWO LABELING; L (P, Q)-LABELING;

CELLULAR RADIO SYSTEMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

LABELING;

EID: 64549139282     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.02.004     Document Type: Article

References (21)

1. t)-coloring of trees and interval graphs. Networks 49 3 (2007) 204-216
2. Bertossi A.A., Pinotti C.M., Rizzi R., and Shende A.M. Channel assignment for interfernce avoidance in honeycomb wireless networks. Journal of Parallel and Distributed Computing 64 (2004) 1329-1344
3. Bodlaender H.L., Kloks T., Tan R.B., and van Leeuwen J. Approximations for λ-coloring of graphs. The Computer Journal 47 2 (2004) 193-204
4. Brandstädt A., Le V.B., and Spinrad J.P. Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications (1999), SIAM
5. Broersma H., Fomin F.V., Golovach P.A., and Woeginger G.J. Backbone coloring for graphs: tree and path backbones. Journal of Graph Theory 55 (2007) 137-152
6. Calamoneri T. The L (h, k)-labelling problem: A survey and annotated bibliography. The Computer Journal 49 5 (2006) 585-608
7. Calamoneri T., and Petreschi R. λ-coloring matrogenic graphs. Discrete Applied Mathematics 154 (2006) 2445-2457
8. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM Journal on Discrete Mathematics 9 2 (1996) 309-316
9. Fiala J., Golovach P.A., and Kratochvíl J. Elegant distance constrained labelings of trees. Proc. WG 2004. Lecture Notes in Computer Science vol. 3353 (2004) 58-67
10. Fiala J., Golovach P.A., and Kratochvíl J. Distance constrained labelings of graphs of bounded treewidth. ICALP 2005. Lecture Notes in Computer Science vol. 3580 (2005) 360-372
11. (2, 1)-labeling problem for regular graphs. ICTCS 2005. Lecture Notes in Computer Science vol. 3701 (2005) 228-236
12. Golumbic M.C. Algorithmic graph theory and perfect graphs. 2nd ed. (2004), Elsevier B.V
13. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance 2. SIAM Journal on Discrete Mathematics 5 4 (1992) 586-595
14. Lu C.L., and Tang C.Y. Solving the weighted efficient edge domination problem on bipartite permutation graphs. Discrete Applied Mathematics 87 (1998) 203-211
15. Shao Z., Yeh R.K., and Zhang D. The L (2, 1)-labeling on graphs and the frequency assignment problem. Applied Mathematics Letters 21 (2008) 37-41
16. Spinrad J., Brandstädt A., and Stewart L. Bipartite permutation graphs. Discrete Applied Mathematics 18 3 (1987) 279-292
17. Steiner G. On the k-path partition of graphs. Theoretical Computer Science 290 (2003) 2147-2155
18. Uehara R., and Valiente G. Linear structure of bipartite permutation graphs and the longest path problem. Information Processing Letters 103 (2007) 71-77
19. van den Heuvel J., Leese R.A., and Shepherd M.A. Graph labeling and radio channel assignment. Journal of Graph Theory 29 (1998) 263-283
20. Xu G., Kang L., and Shan E. Acyclic domination on bipartite permutation graphs. Information Processing Letters 99 (2006) 139-144
21. Yeh R.K. A survey on labeling graphs with a condition at distance two. Discrete Mathematics 306 (2006) 1217-1231