On the Clique-Width of Graphs in Hereditary Classes

The paper presents several results that can be helpful for deciding whether the clique-width of graphs in a certain class is bounded or not, and applies these results to a number of particular graph classes.

[1]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[2]  Vadim V. Lozin,et al.  On the linear structure and clique-width of bipartite permutation graphs , 2003, Ars Comb..

[3]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[4]  Yue-Li Wang,et al.  An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees , 2000, Theory of Computing Systems.

[5]  Johann A. Makowsky,et al.  On the Clique-Width of Graphs with Few P4's , 1999, Int. J. Found. Comput. Sci..

[6]  F. Lazebnik,et al.  A new series of dense graphs of high girth , 1995, math/9501231.

[7]  Vadim V. Lozin,et al.  Bipartite graphs without a skew star , 2002, Discret. Math..

[8]  Vassilis Giakoumakis,et al.  Bipartite Graphs Totally Decomposable by Canonical Decomposition , 1999, Int. J. Found. Comput. Sci..

[9]  Edward R. Scheinerman,et al.  On the Size of Hereditary Classes of Graphs , 1994, J. Comb. Theory B.

[10]  Stephan Olariu,et al.  Paw-Fee Graphs , 1988, Inf. Process. Lett..

[11]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..

[12]  V. Giakoumakis,et al.  Bi-complement Reducible Graphs , 1997 .

[13]  Bruno Courcelle,et al.  Graph grammars, monadic second-order logic and the theory of graph minors , 1991, Graph Structure Theory.

[14]  Russell Merris,et al.  Split graphs , 2003, Eur. J. Comb..

[15]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[16]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[17]  Jeremy P. Spinrad,et al.  Nonredundant 1's in Gamma-Free Matrices , 1995, SIAM J. Discret. Math..

[18]  Vadim V. Lozin.  On a Generalization of Bi-Complement Reducible Graphs , 2000, MFCS.

[19]  Udi Rotics,et al.  On the Clique-Width of Some Perfect Graph Classes , 2000, Int. J. Found. Comput. Sci..

[20]  Vadim V. Lozin,et al.  An attractive class of bipartite graphs , 2001, Discuss. Math. Graph Theory.