L (2, 1) -labeling of perfect elimination bipartite graphs

Discrete Applied Mathematics

Volumn 159, Issue 16, 2011, Pages 1878-1888

  Panda, B S ^a   Goel, Preeti ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Graph algorithms; L (2, 1) labeling; NP complete; Perfect elimination bipartite graphs

Indexed keywords

ADJACENT VERTICES; BIPARTITE GRAPHS; CHAIN GRAPH; CHORDAL BIPARTITE GRAPH; GRAPH ALGORITHMS; GRAPH G; L(2 , 1)-LABELING; LINEAR-TIME ALGORITHMS; MAXIMUM DEGREE; NONNEGATIVE INTEGERS; NP COMPLETE; NP-HARD;

APPROXIMATION ALGORITHMS; COLOR; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; INTEGER PROGRAMMING;

GRAPH THEORY;

EID: 80051746918     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.07.008     Document Type: Conference Paper

References (30)

1. N. Abbas, and L.K. Stewart Biconvex graphs: ordering and algorithms Discrete Appl. Math. 103 1 2000 1 19
2. R.P. Anstee, and M. Farber Characterizations of totally balanced matrices J. Algorithms 5 2 1984 215 230
3. T. Araki Labeling bipartite permutation graphs with a condition at distance two Discrete Appl. Math. 157 2009 1677 1686
4. A.A. Bertossi, C.M. Pinotti, and R.B. Tan Efficient use of radio spectrum in wireless networks with channel separation between close stations DIALM '00: Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications 2000 ACM New York, NY, USA 18 27
5. H.L. Bodlaender, T. Kloks, R.B. Tan, and J.V. Leeuwen λ-coloring of graphs STACS'00: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science 2000 Springer-Verlag London, UK 395 406
6. K.S. Booth, and G.S. Lueker Linear-time algorithm for reduction of a pq-tree J. Comput. System Sci. 3 1976 335 379
7. A. Brandstdt, V.B. Lee, and J. Spinrad Graph Classes: A Survey 1999 SIAM Monograph
8. T. Calamoneri The L (h, k) -labelling problem: a survey and annotated bibliography Comput. J. 49 2006 585 608 (Pubitemid 44592705)
9. T. Calamoneri, S. Caminiti, S. Olariu, and R. Petreschi On the L (h, k) -labeling of co-comparability graphs and circular-arc graphs Networks 53 2009 27 34
10. T. Calamoneri, and R. Petreschi L (h, 1) -labeling subclasses of planar graphs J. Parallel Distrib. Comput. 64 3 2004 414 426
11. G.J. Chang, and D. Kuo The L (2, 1) -labeling problem on graphs SIAM J. Discrete Math. 9 2 1996 309 316
12. F.F. Dragan, and F. Nicolai Lexbfs-orderings of distance-hereditary graphs with application to the diametral pair problem Discrete Appl. Math. 98 2000 191 207
13. M. Farber Characterizations of strongly chordal graphs Discrete Math. 43 1983 173 189
14. J. Fiala, T. Kloks, and J. Kratochvil Fixed parameter complexity of λ-labelings Discrete Appl. Math. 113 2001 59 72
15. M.C. Golumbic, and C.F. Goss Perfect elimination and chordal bipartite graphs J. Graph Theory 2 1978 155 163
16. D. Gonalves On the L (p, 1) -labelling of graphs Discrete Math. 308 2008 1405 1414
17. J.R. Griggs, and R.K. Yeh Labelling graphs with a condition at distance 2 SIAM J. Discrete Math. 5 1992 586 595
18. F. Havet, B. Reed, and J.S. Sereni L (2, 1) -labeling of graphs Proc. 19th annual ACMSIAM Symposium on Discrete Algorithms, SODA 2008 2008 SIAM 621 630
19. W.K. Hale Frequency assignment: theory and applications Proc. IEEE 68 1980 1497 1514
20. E. Howorka A characterization of distance-hereditary graphs Quart. J. Math. Oxford Ser. 2 28 1977 417 420
21. J.-H. Kang L (2, 1) -labeling of Hamiltonian graphs with maximum degree 3 SIAM J. Discrete Math. 22 2008 213 230
22. D. Král' Coloring powers of chordal graphs SIAM J. Discrete Math. 18 3 2005 426 437
23. D. Král', and R. Skrekovski A theorem about the channel assignment problem SIAM J. Discrete Math. 16 2003 426 437
24. T.-H. Lai, and S.S. Wei Bipartite permutation graphs with application to the minimum buffer size problem Discrete Appl. Math. 74 1997 33 55 (Pubitemid 127418662)
25. A. Lubiw Doubly lexical orderings of matrices STOC'85: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing 1985 ACM New York, NY, USA 396 404
26. D. Sakai Labeling chordal graphs: distance two condition SIAM J. Discrete Math. 7 1994 133 140
27. J. Spinrad, A. Brandstdt, and L. Stewart Bipartite permutation graphs Discrete Appl. Math. 18 1987 279 292
28. R. Uehara, and Y. Uno Efficient algorithms for the longest path problem 15th Annual International Symposium on Algorithms and Computation Lecture Notes in Computer Science vol. 3341 December,2004 Springer Berlin Heidelberg 871 883 (Pubitemid 39745132)
29. R.K. Yeh A survey on labeling graphs with a condition at distance two Discrete Math. 306 2006 1217 1231 (Pubitemid 44208821)
30. C.-W. Yu, and G.-H. Chen Efficient parallel algorithms for doubly convex-bipartite graphs Theoret. Comput. Sci. 147 1995 249 265