Line graphs of bounded clique-width

Discrete Mathematics

Volumn 307, Issue 22, 2007, Pages 2734-2754

  Gurski, Frank ^a   Wanke, Egon ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Clique width; Incidence graphs; Line graphs; NLC width; Tree width

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

CLIQUE-WIDTH; INCIDENCE GRAPHS; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 35448975919     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.01.020     Document Type: Article

References (40)

1. Arnborg S., Corneil D.G., and Proskurowski A. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8 2 (1987) 277-284
2. Arnborg S., Courcelle B., Proskurowski A., and Seese D. An algebraic theory of graph reduction. J. ACM 40 5 (1993) 1134-1164
3. Beineke L.W. Characterization of derived graphs. J. Combin. Theory 9 (1970) 129-135
4. Bodlaender H.L. Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees. J. Algorithms 11 4 (1990) 631-643
5. Bodlaender H.L., Gilbert J.R., Hafsteinsson H., and Kloks T. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms 18 2 (1995) 238-255
6. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, in: Proceedings of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, vol. 2573, Springer, Berlin, 2002, pp. 57-67.
7. D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width at most three graphs, in: Proceedings of Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, vol. 1776, Springer, Berlin, 2000, pp. 126-134.
8. Corneil D.G., Perl Y., and Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14 4 (1985) 926-934
9. Corneil D.G., and Rotics U. On the relationship between clique-width and treewidth. SIAM J. Comput. 4 (2005) 825-847
10. Courcelle B., Makowsky J.A., and Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33 2 (2000) 125-150
11. Courcelle B., and Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101 (2000) 77-114
12. Engelfriet J., and Rozenberg G. Node replacement graph grammars. Handbook of Grammars and Computing by Graph Transformation (1997), World Scientific, Singapore 1-94
13. W. Espelage, F. Gurski, E. Wanke, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time, in: Proceedings of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, vol. 2204, Springer, Berlin, 2001, pp. 117-128.
14. Espelage W., Gurski F., and Wanke E. Deciding clique-width for graphs of bounded tree-width. J. Graph Algorithms Appl. 7 2 (2003) 141-180 (Special Issue of JGAA on WADS 2001)
15. M.R. Fellows, F.A. Rosamund, U. Rotics, S. Szeider, Proving NP-hardness for clique-width I: non-approximability of sequential clique-width, Technical Report TR05-080, Electronic Colloquium on Computational Complexity (ECCC), 2005.
16. M.R. Fellows, F.A. Rosamund, U. Rotics, S. Szeider, Proving NP-hardness for clique-width II: non-approximability of clique-width, Technical Report TR05-081, Electronic Colloquium on Computational Complexity (ECCC), 2005.
17. Fellows M.R., Rosamund F.A., Rotics U., and Szeider S. Clique-width minimization is NP-hard. Proceedings of the Annual ACM Symposium on Theory of Computing (2006), ACM, New York 354-362
18. Golumbic M.C., and Rotics U. On the clique-width of some perfect graph classes. International J. Found. Comput. Sci. 11 3 (2000) 423-443
19. A. Gupta, N. Nishimura, A. Proskurowski, P. Ragde, Embeddings of k-connected graphs of pathwidth k, in: Proceedings of Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 1851, Springer, Berlin, 2000, pp. 111-124.
20. n, n, in: Proceedings of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1938, Springer, Berlin, 2000, pp. 196-205.
21. F. Gurski, E. Wanke, Vertex disjoint paths on clique-width bounded graphs, in: Proceedings of Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, vol. 2976, Springer, Berlin, 2004, pp. 119-128 (Extended abstract).
22. F. Gurski, E. Wanke, Minimizing NLC-width is NP-complete (Extended Abstract), in: Proceedings of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, vol. 3787, Springer, Berlin, 2005, pp. 69-80.
23. Gurski F., and Wanke E. On the relationship between NLC-width and linear NLC-width. Theoret. Comput. Sci. 347 1-2 (2005) 76-89
24. Gurski F., and Wanke E. Vertex disjoint paths on clique-width bounded graphs. Theoret. Comput. Sci. 359 1-3 (2006) 188-199
25. Johansson O. Clique-decomposition, NLC-decomposition, and modular decomposition-relationships and results for random graphs. Congr. Numer. 132 (1998) 39-60
26. 2-decomposition in polynomial time. Internat. J. Found. Comput. Sci. 11 3 (2000) 373-395
27. Kobler D., and Rotics U. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126 2-3 (2003) 197-221
28. Lehot P.G.H. An optimal algorithm to detect a line graph and output its root graph. J. ACM 21 4 (1974) 569-575
29. Lozin V., and Rautenbach D. Chordal bipartite graphs of bounded tree- and clique-width. Discrete Math. 283 (2004) 151-158
30. Nishizeki T., Vygen J., and Zhou X. The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Appl. Math. 115 (2001) 177-186
31. S.-I. Oum, Approximating rank-width and clique-width quickly, in: Proceedings of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, vol. 3787, Springer, Berlin, 2005, pp. 49-58.
32. Oum S.-I., and Seymour P.D. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96 4 (2006) 514-528
33. Robertson N., and Seymour P.D. Graph minors I. Excluding a forest. J. Combin. Theory Ser. B 35 (1983) 39-61
34. Robertson N., and Seymour P.D. Graph minors II. Algorithmic aspects of tree width. J. Algorithms 7 (1986) 309-322
35. Rose D.J. On simple characterizations of k-trees. Discrete Math. 7 (1974) 317-322
36. Roussopoulos N.D. A max{ m, n } algorithm for determining the graph H from its line graph G. Inform. Process. Lett. 2 (1973) 108-112
37. P. Scheffler, A practical linear time algorithm for vertex disjoint paths in graphs with bounded treewidth, Technical Report 396, Department of Mathematics, Technische Universität Berlin, 1994.
38. I. Todinca, Coloring powers of graphs of bounded clique-width, in: Proceedings of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, vol. 2880, Springer, Berlin, 2003, pp. 370-382.
39. Wanke E. k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54 (1994) 251-266
40. Whitney H. Congruent graphs and the connectivity of graphs. Amer. J. Math. 54 (1932) 150-168