Graphs of linear clique-width at most 3

We give the first characterisation of graphs of linear cliquewidth at most 3, and we give a polynomial-time recognition algorithm for such graphs.

[1]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[2]  Frank Gurski,et al.  Characterizations for co-graphs defined by restricted NLC-width or clique-width operations , 2006, Discret. Math..

[3]  Egon Wanke,et al.  On the relationship between NLC-width and linear NLC-width , 2005, Theor. Comput. Sci..

[4]  Frank Gurski,et al.  Linear layouts measuring neighbourhoods in graphs , 2006, Discret. Math..

[5]  N. Mahadev,et al.  Threshold graphs and related topics , 1995 .

[6]  Georg Gottlob,et al.  Width Parameters Beyond Tree-width and their Applications , 2008, Comput. J..

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

[8]  Dieter Rautenbach,et al.  The relative clique-width of a graph , 2007, J. Comb. Theory, Ser. B.

[9]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[10]  B. Reed,et al.  Polynomial Time Recognition of Clique-Width ≤ 3 Graphs , 2000 .

[11]  Udi Rotics,et al.  Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract) , 2000, Latin American Symposium on Theoretical Informatics.

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

[13]  Laurent Viennot,et al.  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..

[14]  Udi Rotics,et al.  Clique-Width is NP-Complete , 2009, SIAM J. Discret. Math..

[15]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[16]  Udi Rotics,et al.  Clique-width minimization is NP-hard , 2006, STOC '06.

[17]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[18]  Jens Gustedt,et al.  Efficient and Practical Algorithms for Sequential Modular Decomposition , 2001, J. Algorithms.

[19]  Dieter Kratsch,et al.  Domination on Cocomparability Graphs , 1993, SIAM J. Discret. Math..