Chordal bipartite graphs of bounded tree- and clique-width

Discrete Mathematics

Volumn 283, Issue 1-3, 2004, Pages 151-158

  Lozin, V ^a   Rautenbach, D ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Bipartite graph; Chordal graph; Clique width; Forbidden induced subgraph; Tree width

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

BIPARTITE GRAPH; CHORDAL GRAPH; CLIQUE-WIDTH; FORBIDDEN INDUCED SUBGRAPH; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 2442659456     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.02.008     Document Type: Article

References (32)

1. Abbas N., Stewart L.K. Biconvex graphs. ordering and algorithms Discrete Appl. Math. 103:2000;1-19.
2. Alekseev V.E. A polynomial algorithm for finding the largest independent sets in fork-free graphs. Discrete Anal. Oper. Res. Ser. 1. 6:1999;3-19. (in Russian).
3. Anstee R.P., Farber M. Characterizations of totally balanced matrices. J. Algorithms. 5:1984;215-230.
4. Bandelt H.-J., Mulder H.M. Distance-hereditary graphs. J. Combin. Theory Ser. B. 41:1986;182-208.
5. Bodlaender H.L. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25:1996;1305-1317.
6. R. Boliac, V.V. Lozin, On the Clique-width of Graphs in Hereditary Classes, Lecture Notes in Computer Science, Vol. 2518, Springer, New York, 2002, pp. 44-54.
7. Boliac R., Lozin V.V. Independent domination in finitely defined classes of graphs. Theoret. Comput. Sci. 301:2003;271-284.
8. Brandstädt A., Lozin V.V. On the linear structure and clique-width of bipartite permutation graphs. Ars Combin. 67:2003;273-281.
9. Courcelle B. The monadic second-order logic of graphs. III. Tree-decompositions, minors and complexity issues. RAIRO Inform. Théor. Appl. 26:1992;257-286.
10. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46:1993;218-270.
11. Courcelle B., Makowsky J.A., Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Systems. 33:2000;125-150.
12. Courcelle B., Makowsky J.A., Rotics U. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math. 108:2001;23-52.
13. Courcelle B., Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101:2000;77-114.
14. Damaschke P., Müller H., Kratsch D. Domination in convex and chordal bipartite graphs. Inform. Process. Lett. 36:1990;231-236.
15. Fouquet J-L., Giakoumakis V., Vanherpe J.M. Bipartite graphs totally decomposable by canonical decomposition. Internat. J. Foundations Comput. Sci. 10:1999;513-533.
16. Giakoumakis V., Vanherpe J.-M. Bi-complement reducible graphs. Adv. in Appl. Math. 18:1997;389-402.
17. Golumbic M.C., Goss C.F. Perfect elimination and chordal bipartite graphs. J. Graph Theory. 2:1978;155-163.
18. Golumbic M.C., Rotics U. On the clique-width of some perfect graph classes. Internat. J. Foundations Comput. Sci. 11:2000;423-443.
19. Hammer P.L., Peled U.N., Sun X. Difference graphs. Discrete Appl. Math. 28:1990;35-44.
20. Kloks T., Kratsch D. Treewidth of chordal bipartite graphs. J. Algorithms. 19:1995;266-281.
21. Lozin V.V. E-free bipartite graphs. Discrete Anal. Oper. Res. Ser. 1. 7:2000;49-66. (in Russian).
22. V.V. Lozin, On a Generalization of Bi-complement Reducible Graphs, Lecture Notes in Computer Science, Vol. 1893, Springer, New York, 2000, pp. 528-538.
23. Lozin V.V. Bipartite graphs without a skew star. Discrete Math. 257:2002;83-100.
24. Lozin V.V., Gerber M.U. On the jump number problem in hereditary classes of bipartite graphs. Order. 17:2000;377-385.
25. 4 's Internat. J. Foundations Comput. Sci. 10:1999;329-348.
26. Müller H. Alternating cycle-free matching. Order. 7:1990;11-21.
27. Müller H. Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156:1996;291-298.
28. Müller H., Brandstädt A. The NP-completeness of steiner tree and dominating set for chordal bipartite graphs. Theoret. Comput. Sci. 53:1987;257-265.
29. B. Reed, Tree width and tangles: a new connectivity measure and some applications, in: London Mathematical Society Lecture Note Series, Vol. 241, Cambridge University Press, Cambridge, 1997, pp. 87-162.
30. Scheinerman E.R., Zito J. On the size of hereditary classes of graphs. J. Combin. Theory Ser. B. 61:1994;16-39.
31. Spinrad J. Nonredundant 1's in. Γ -free matrices SIAM J. Discrete Math. 8:1995;251-257.
32. Spinrad J., Brandstädt A., Stewart L. Bipartite permutation graphs. Discrete Appl. Math. 18:1987;279-292.