On the relationship between NLC-width and linear NLC-width

Theoretical Computer Science

Volumn 347, Issue 1-2, 2005, Pages 76-89

  Gurski, Frank ^a   Wanke, Egon ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Clique width; Linear clique width; Linear NLC width; NLC width; NLCT width

Indexed keywords

GRAPH THEORY; LINEAR SYSTEMS; TREES (MATHEMATICS);

BINARY TREES; CO-GRAPHS; NLC-WIDTH;

COMPUTER SCIENCE;

EID: 27844491884     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.05.018     Document Type: Article

References (23)

1. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, in: Proc. of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 2573, Springer, Berlin, 2002, pp. 57-67.
2. A. Brandstädt, V.B. Le, and J.P. Spinrad Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications 1999 Springer Berlin, Heidelberg, New York
3. D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width at most three graphs, in: Proc. of Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, Vol. 1776, Springer, Berlin, 2000, pp. 126-134.
4. D.G. Corneil, H. Lerchs, and L. Stewart-Burlingham Complement reducible graphs Discrete Appl. Math. 3 1981 163 174
5. D.G. Corneil, Y. Perl, and L.K. Stewart A linear recognition algorithm for cographs SIAM J. Comput. 14 4 1985 926 934
6. B. Courcelle, J.A. Makowsky, and U. Rotics Linear time solvable optimization problems on graphs of bounded clique-width Theory Comput. Syst. 33 2 2000 125 150
7. B. Courcelle, and S. Olariu Upper bounds to the clique width of graphs Discrete Appl. Math. 101 2000 77 114
8. W. Espelage, F. Gurski, E. Wanke, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time, in: Proc. of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 2204, Springer, Berlin, 2001, pp. 117-128.
9. W. Espelage, F. Gurski, and E. Wanke Deciding clique-width for graphs of bounded tree-width J. Graph Algorithms Appl. - Special Issue of JGAA on WADS 2001 7 2 2003 141 180
10. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company San Francisco
11. M.C. Golumbic, and U. Rotics On the clique-width of some perfect graph classes Internat. J. Found. Comp. Sci. 11 3 2000 423 443
12. n,n, in: Proc. of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1938, Springer, Berlin, 2000, pp. 196-205.
13. Ö. Johansson Clique-decomposition, NLC-decomposition and modular decomposition - relationships and results for random graphs Congr. Numer. 132 1998 39 60
14. 2 -decomposition in polynomial time Internat. J. Found. Comp. Sci. 11 3 2000 373 395
15. Ö. Johansson, Graph decomposition using node labels, Ph.D. Thesis, Royal Institute of Technology, Stockholm, 2001.
16. D. Kobler, and U. Rotics Edge dominating set and colorings on graphs with fixed clique-width Discrete Appl. Math. 126 2-3 2003 197 221
17. T. Lengauer Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees SIAM J. Algebraic Discrete Methods 3 1 1982 99 113
18. V. Lozin, D. Rautenbach, The relative clique-width of a graph, Technical Report RRR 16-2004, Rutgers University, 2004.
19. N. Robertson, and P.D. Seymour Graph minors I, Excluding a forest J. Combin. Theory, Ser. B 35 1983 39 61
20. N. Robertson, and P.D. Seymour Graph minors II, Algorithmic aspects of tree width J. Algorithms 7 1986 309 322
21. D. Seinsche On a property of the class of n-colorable graphs J. Combin. Theory B 16 1974 191 193
22. I. Todinca, Coloring powers of graphs of bounded clique-width, in: Proc. of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 2880, Springer, Berlin, 2003, pp. 370-382.
23. E. Wanke k-NLC graphs and polynomial algorithms Discrete Appl. Math. 54 1994 251 266