Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs

Abstract We study the linear clique-width of graphs that are obtained from paths by disjoint union and adding true twins. We show that these graphs have linear clique-width at most 4, and we give a complete characterisation of their linear clique-width by forbidden induced subgraphs. As a consequence, we obtain a linear-time algorithm for computing the linear clique-width of the considered graphs. Our results extend the previously known set of forbidden induced subgraphs for graphs of linear clique-width at most 3.

[1]  Udi Rotics,et al.  On the Relationship between Clique-Width and Treewidth , 2001, WG.

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

[3]  Pinar Heggernes,et al.  A Complete Characterisation of the Linear Clique-Width of Path Powers , 2009, TAMC.

[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]  Udi Rotics,et al.  Clique-Width is NP-Complete , 2009, SIAM J. Discret. Math..

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

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

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

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

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

[12]  D. Meister,et al.  Graphs of small bounded linear clique-width ∗ , 2007 .

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

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

[15]  Pinar Heggernes,et al.  Graphs of linear clique-width at most 3 , 2008, Theor. Comput. Sci..