New Graph Classes of Bounded Clique-Width
Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms; it is known that every algorithmic problem expressible in a certain kind of Monadic Second Order Logic called LinEMSOL(τ 1,L ) by Courcelle, Makowsky and Rotics, is solvable in linear time on any graph class with bounded clique-width for which a k-expression for the input graph can be constructed in linear time. The concept of clique-width extends the one of treewidth since bounded treewidth implies bounded clique-width.
We give a complete classification of all graph classes defined by forbidden one-vertex extensions of the P 4 with respect to their clique-width. Our results extend and improve recently published structural and complexity results in a systematic way.
Unable to display preview. Download preview PDF.
- 2.A. Brandstädt, (P5,diamond)-Free Graphs Revisited: Structure, Bounded cliquewidth and Linear Time Optimization, Manuscript 2000; accepted for Discrete Applied Math. Google Scholar
- 3.A. Brandstädt, C.T. Hoàng, V.B. Le, Stability Number of Bull-and Chair-Free Graphs Revisited, Manuscript 2001; accepted for Discrete Applied Math. Google Scholar
- 4.A. Brandstädt, D. Kratsch, On the structure of (P5,gem)-free graphs, Manuscript 2001Google Scholar
- 5.A. Brandstädt, H.-O. Le, R. Mosca, Chordal co-gem-free graphs have bounded clique-width, Manuscript 2002Google Scholar
- 6.A. Brandstädt, H.-O. Le, R. Mosca, (Gem,co-gem)-free graphs have bounded clique-width, Manuscript 2002Google Scholar
- 7.A. Brandstädt, V.B. Le, J. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Math. Appl., Vol. 3, SIAM, Philadelphia (1999)Google Scholar
- 8.A. Brandstädt, H.-O. Le, J.-M. Vanherpe, Structure and Stability Number of (Chair, Co-P, Gem)-Free Graphs, Manuscript 2001Google Scholar
- 9.A. Brandstädt, S. Mahfud, Linear time for Maximum Weight Stable Set on (claw,co-claw)-free graphs and similar graph classes, Manuscript 2001; to appear in Information Processing Letters Google Scholar
- 10.A. Brandstädt, R. Mosca, On the Structure and Stability Number of P5-and Co-Chair-Free Graphs, Manuscript 2001; accepted for Discrete Applied Math. Google Scholar
- 11.A. Brandstädt, R. Mosca, On Variations of P4-Sparse Graphs, Manuscript 2001Google Scholar
- 16.B. Courcelle, J.A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique width, extended abstract in: Conf. Proc. WG’98, LNCS 1517 (1998) 1–16; Theory of Computing Systems 33 (2000) 125-150Google Scholar
- 19.S. Földes, P.L. Hammer, Split graphs, Congress. Numer. 19 (1977), 311–315Google Scholar
- 24.A. Hertz, On a graph transformation which preserves the stability number, Yugoslav Journal of Oper. Res., to appearGoogle Scholar
- 25.C.T. Hoàng, A Class of Perfect Graphs, Ms. Sc. Thesis, School of Computer Science, McGill University, Montreal (1983)Google Scholar
- 26.C.T. Hoàng, Perfect Graphs, Ph. D. Thesis, School of Computer Science, McGill University, Montreal (1985)Google Scholar
- 30.N.V.R. Mahadev, U.N. Peled, Threshold Graphs and Related Topics, Annals of Discrete Mathematics 56 (1995)Google Scholar
- 32.R.H. Möhring, F.J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Annals of Discrete Math. 19 (1984) 257–356Google Scholar
- 34.I.E. Zverovich, I.I. Zverovich, Extended (P5,P5)-free graphs, Rutcor Research Report RRR 22-2001 (2001) http://rutcor.rutgers.edu/~rrr