论文信息 - Graphs of small bounded linear clique-width ∗

Graphs of small bounded linear clique-width ∗

In this paper we give the first characterisation of graphs with linear clique-width at most 3, and we give a polynomial-time recognition algorithm for such graphs. In addition, we give a new characterisation of graphs with linear clique-width at most 2 and a new layout characterisation of linear clique-width in general. Among our results is also a decomposition scheme that preserves the linear clique-width of the decomposable subgraph.

D. Meister | P. Heggernes | D. Meister | P. Heggernes

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

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

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

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

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

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

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

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

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

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

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

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

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

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