Vertex-minor reductions can simulate edge contractions

Discrete Applied Mathematics

Volumn 155, Issue 17, 2007, Pages 2328-2340

  Kanté, Mamadou Moustapha ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Clique width; Edge contraction; Local complementation; Rank width; Tree decomposition; Tree width; Vertex minor

Indexed keywords

COMPUTER SIMULATION; EDGE DETECTION; LINEAR PROGRAMMING; OPERATIONS RESEARCH;

EDGE CONTRACTIONS; LOCAL COMPLEMENTATION; VERTEX DELETION; VERTEX-MINOR REDUCTIONS;

GRAPH THEORY;

EID: 34648820344     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.06.011     Document Type: Article

References (17)

1. Bodlaender H.L. A tourist guide through tree-width. Acta Cybernet. 11 (1993) 1-23
2. Bodlaender H.L. A partial k-arboretum of graphs with bounded tree-width. Theoretical Comput. Sci. 209 (1998) 1-45
3. D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width ≤ 3 graphs, LATIN'00: Latin American Theoretical Informatics, vol. 1776, 2000, pp. 126-134.
4. Corneil D.G., and Rotics U. On the relationship between clique-width and tree-width. SSIAM J. Comput. 34 (2005) 825-847
5. Courcelle B. The expression of graph properties and graph transformations in monadic second order logic. In: Rozenberg G. (Ed). Handbook of Graph Grammars and Computing by Graph Transformations (1997), World Scientific, Singapore 313-400
6. Courcelle B., and Olariu S. Upper bounds to the clique-width of graphs. Discrete Appl. Math. 101 (2000) 77-114
7. Courcelle B., and Oum S. Vertex-minors, monadic second-order logic and a conjecture by Seese. J. Combin. Theory Ser. B 97 (2006) 91-126
8. Fellows M., Rosamond F.A., Rotics U., and Szeider S. Clique-width minimization is NP-Hard. Proceedings of STOC'06: 38th ACM Symposium on Theory of Computing. Seattle (2006), ACM Press, New York 354-362
9. S. Oum, Approximating rank-width and clique-width quickly, in: Graph-Theoretic Concepts in Computer Science, Metz, Lecture Notes in Computer Science, vol. 3787, Springer, Berlin, 2005, pp. 49-58.
10. Oum S. Rank-width and vertex-minors. J. Combin. Theory Ser. B 95 (2006) 79-100
11. S. Oum, Rank-width is less than or equal to branch-width, 2006, submitted for publication.
12. Oum S., and Seymour P. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96 (2006) 514-528
13. Robertson N., and Seymour P. Graph minors V: excluding a planar graph. J. Combin. Theory (B) 41 (1986) 92-114
14. Robertson N., and Seymour P. Graphs minors X: obstructions to tree-decompositions. J. Combin. Theory (B) 52 (1991) 153-190
15. Robertson N., and Seymour P. Graphs minors XIII: the disjoint paths problem. J. Combin. Theory (B) 63 (1995) 65-110
16. Robertson N., and Seymour P. Graph minors XX: Wagner's conjecture. J. Combin. Theory (B) 92 (2004) 325-357
17. D. Seese, Tree-partite graphs and the complexity of algorithms, in: Proceedings of the International Conference on Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 199, Springer, Berlin, 1985, pp. 412-421.