On the linear structure and clique-width of bipartite permutation graphs

Ars Combinatoria

Volumn 67, Issue , 2003, Pages 273-281

  Brandstadt A ^a   Lozin, V V ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b the State University of New Jersey   (United States)

Author keywords

Bipartite permutation graphs; Clique width

Indexed keywords

EID: 14944372320     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. A. Brandstädt, J. Spinrad and L Stewart, Bipartite permutation graphs are bipartite tolerance graphs, Congr. Numer. 58 (1987) 165-164.
2. L. Chen, J.Y. Jiang and M.T. Nyeu, Provably fastest parallel algorithms for bipartite permutation graphs, Parallel Process. Lett. 9 (1999) 385-390.
3. L. Chen, Solving the shortest path problem on bipartite permutation graphs efficiently, Inform. Process. Lett. 55 (1995) 259-264.
4. L. Chen and Y. Yesha, Efficient parallel algorithms for bipartite permutation graphs, Networks 23 (1993) 29-39.
5. D.G. Corneil, S. Olariu and L. Stewart, Asteroidal triple-free graphs, SIAM J. Discrete Math. 10 (1997) 399-430.
6. U. Derigs, O. Goecke and R. Schrader, Bisimplicial edges, Gaussian elimination and matchings in bipartite graphs, Inter. Workshop on Graph-Theoretic Concepts in Comp. Sci. Trauner Verlag, Berlin, W. Germany (1984) 79-87.
7. G. Ding, Covering the edges with consecutive sets, J. Graph Theory 15 (1991) 559-562.
8. H. Frost, M. Jacobson, J. Kabell, F.R. Morris, Bipartite analogues of split graphs and related topics, ARS Combinatorica, 29 (1990) 283-288.
9. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hung. 18 (1967) 25-66.
10. M.C. Golumbic and U. Rotics, On the clique-width of some perfect graph classes, Internat. J. Found. Comput. Sci. 11 (2000) 423-443.
11. P.L. Hammer and K. Kelmans, On universal threshold graphs, Combinatorics, probability and computing 3 (1994) 327-344.
12. P.L. Hammer, U.N. Peled, and X. Sun, Difference graphs. Discrete Appl. Math. 28 (1990) 35-44.
13. H. Kim and A.P. Sprague, Optimal parallel matchings on bipartite permutation graphs, Parallel Algorithms Appl. 10 (1997) 165-176.
14. T. Kloks, D. Kratsch and H. Müller, Bandwidth of chain graphs, Inform. Process. Lett. 68 (1998) 313-315.
15. 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.
16. C.L. Lu and C. Y. Tang, Solving the weighted efficient edge domination problem on bipartite permutation graphs, Discrete Appl. Math. 87 (1998) 203-211.
17. J. Spinrad, A. Brandstädt and L. Stewart, Bipartite permutation graphs, Discrete Appl. Math. (1987) 68-77.
18. R. Srikant, R. Sundaram, K. Sher Singh and C. Pandu Rangan, Optimal path cover problem on block graphs and bipartite permutation graphs, Theoret. Comput. Sci. 115 (1993) 351-357.
19. A. Srinivasan, K. Mudhukar, P. Nagavamsi, C. Pandu Rangan and M.-S. Chang, Edge domination on bipartite permutation graphs and cotriangulated graphs, Inform. Process. Lett. 56 (1995) 165-171.