The tree-and clique-width of bipartite graphs in special classes

Australasian Journal of Combinatorics

Volumn 34, Issue , 2006, Pages 57-67

  Lozin, V V ^a   Rautenbach, D ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247632368     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. R. Boliac and V.V. Lozin, An attractive class of bipartite graphs, Discus- siones Mathematicae Graph Theory, (2)(2001), 293-301.
2. R. Boliac, V. Lozin, On the clique-width of graphs in hereditary classes, Lecture Notes in Computer Science, 2518 (2002), 44-54.
3. A. Brandstädt and V.V. Lozin, On the linear structure and clique-width of bipartite permutation graphs, Ars Combinatoria, 67 (2003), 273-289.
4. B. Courcelle and S. Olariu, Upper bounds to the clique-width of a graph, Discrete Applied Math. 101 (2000), 77-114.
5. J-L. Fouquet, V. Giakoumakis and J.M. Vanherpe, Bipartite graphs totally decomposable by canonical decomposition, International J. Foundations of Computer Science, 10 (4) (1999), 513-533.
6. V. Giakoumakis and J.-M. Vanherpe, Bi-complement reducible graphs, Advances in Appl. Math. 18 (1997), 389-402.
7. M.C. Golumbic and U. Rotics, On the clique-width of some perfect graph classes, International J. Foundations of Computer Science, 11 (2000), 423-443.
8. V.V. Lozin, Bipartite graphs without a skew star, Discrete Mathematics, 257 (2002), 83-100.
9. V.V. Lozin and D. Rautenbach, Chordal bipartite graphs of bounded tree- and clique-width, Discrete Mathematics, 283 (2004), 151-158.
10. R.M. McConnell and J. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, 201 (1999), 189-241.
11. B. Reed, Tree width and tangles: a new connectivity measure and some applications, in London Math, Soc, Lecture Note, Ser. 241, pp. 87-162, Cambridge Univ. Press, Cambridge, 1997.