Vertex-minors, monadic second-order logic, and a conjecture by Seese

Journal of Combinatorial Theory. Series B

Volumn 97, Issue 1, 2007, Pages 91-126

  Courcelle, Bruno ^a   Oum, Sang il ^b  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Clique width; Isotropic system; Local complementation; Monadic second order logic; Rank width; Seese's conjecture; Vertex minor

Indexed keywords

EID: 33751429952     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2006.04.003     Document Type: Article

References (52)

1. Bandelt H.-J., and Mulder H.M. Distance-hereditary graphs. J. Combin. Theory Ser. B 41 2 (1986) 182-208
2. Bouchet A. Isotropic systems. European J. Combin. 8 3 (1987) 231-244
3. Bouchet A. Graphic presentations of isotropic systems. J. Combin. Theory Ser. B 45 1 (1988) 58-76
4. Bouchet A. Transforming trees by successive local complementations. J. Graph Theory 12 2 (1988) 195-207
5. Bouchet A. κ-Transformations, local complementations and switching. Cycles and Rays. Montreal, PQ, 1987. NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. vol. 301 (1990), Kluwer Acad. Publ., Dordrecht 41-50
6. Bouchet A. Circle graph obstructions. J. Combin. Theory Ser. B 60 1 (1994) 107-144
7. Comon H., Dauchet M., Gilleron R., Jacquemard F., Lugiez D., Tison S., and Tommasi M. Tree automata techniques and applications. Available on: (1997). http://www.grappa.univ-lille3.fr/tata release October, 1st 2002
8. Corneil D.G., Habib M., Lanlignel J.-M., Reed B., and Rotics U. Polynomial time recognition of clique-width ≤3 graphs (extended abstract). In: Gonnet G.H., et al. (Ed). LATIN 2000: Theoretical Informatics. 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000. Lecture Notes in Comput. Sci. vol. 1776 (2000), Springer, Berlin 126-134
9. Corneil D.G., Perl Y., and Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14 4 (1985) 926-934
10. Courcelle B. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. and Comput. 85 1 (1990) 12-75
11. Courcelle B. Monadic second-order definable graph transductions: A survey. Theoret. Comput. Sci. 126 1 (1994) 53-75
12. Courcelle B. The monadic second-order logic of graphs. X. Linear orderings. Theoret. Comput. Sci. 160 1-2 (1996) 87-143
13. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic. Handbook of Graph Grammars and Computing by Graph Transformation vol. 1 (1997), World Scientific, River Edge, NJ 313-400
14. Courcelle B. The monadic second-order logic of graphs. XIV. Uniformly sparse graphs and edge set quantifications. Theoret. Comput. Sci. 299 1-3 (2003) 1-36
15. Courcelle B. Clique-width of countable graphs: A compactness property. Discrete Math. 266 1-3 (2004) 127-148
16. Courcelle B. The monadic second-order logic of graphs XV: On a conjecture by D. Seese. J. Appl. Log. 1 (2006) 79-114
17. B. Courcelle, R.G. Downey, M.R. Fellows, A note on the computability of graph minor obstruction sets for monadic second order ideals, in: Proceedings of the First Japan-New Zealand Workshop on Logic in Computer Science, Auckland, 1997, vol. 3, 1997, pp. 1194-1198 (electronic)
18. Courcelle B., and Engelfriet J. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Math. Systems Theory 28 6 (1995) 515-552
19. Courcelle B., Engelfriet J., and Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46 2 (1993) 218-270
20. Courcelle B., and Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101 1-3 (2000) 77-114
21. Courcelle B., and Weil P. The recognizability of sets of graphs is a robust property. Theoret. Comput. Sci. 342 2-3 (2005) 173-228
22. Doner J. Tree acceptors and some of their applications. J. Comput. System Sci. 4 (1970) 406-451
23. Downey R.G., and Fellows M.R. Parameterized Complexity. Monogr. Comput. Sci. (1999), Springer, New York
24. Engelfriet J., and van Oostrom V. Logical description of context-free graph languages. J. Comput. System Sci. 55 3 (1997) 489-503
25. Espelage W., Gurski F., and Wanke E. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. Graph-Theoretic Concepts in Computer Science. Boltenhagen, 2001. Lecture Notes in Comput. Sci. vol. 2204 (2001), Springer, Berlin 117-128
26. Feferman S., and Vaught R.L. The first order properties of products of algebraic systems. Fund. Math. 47 (1959) 57-103
27. M.R. Fellows, F.A. Rosamond, U. Rotics, S. Szeider, Proving NP-hardness for clique-width II: Non-approximability of clique-width, Report TR05-081, Revision 01, Electronic Colloquium on Computational Complexity, 2005
28. M.R. Fellows, F.A. Rosamond, U. Rotics, S. Szeider, Clique-width minimization is NP-hard, in: Proceedings of the 38th ACM Symposium on Theory of Computing, 2006, in press
29. Geelen J.F., Gerards A.M.H., and Whittle G. Branch-width and well-quasi-ordering in matroids and graphs. J. Combin. Theory Ser. B 84 2 (2002) 270-290
30. J.F. Geelen, A.M.H. Gerards, G. Whittle, Excluding a planar graph from GF (q)-representable matroids, Research Report 03-4, School of Mathematical and Computing Sciences, Victoria University of Wellington, 2003
31. Golumbic M.C., and Rotics U. On the clique-width of some perfect graph classes. Internat. J. Found. Comput. Sci. 11 3 (2000) 423-443 Selected papers from the Workshop on Theoretical Aspects of Computer Science (WG 99), Part 1 (Ascona)
32. Hliněný P. On matroid properties definable in the MSO logic. Mathematical Foundations of Computer Science, 2003. Lecture Notes in Comput. Sci. vol. 2747 (2003), Springer, Berlin 470-479
33. Hliněný P. Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B 96 (2006) 325-351
34. Hliněný P., and Seese D. Trees, grids, and MSO decidability: From graphs to matroids. Theoret. Comput. Sci. 351 3 (2006) 372-393
35. 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
36. Makowsky J.A. Algorithmic uses of the Feferman-Vaught theorem. Ann. Pure Appl. Logic 126 1-3 (2004) 159-213
37. Oum S. Approximating rank-width and clique-width quickly. Graph-Theoretic Concepts in Computer Science. Metz, 2005. Lecture Notes in Comput. Sci. vol. 3787 (2005), Springer, Berlin 49-58
38. S. Oum, Graphs of bounded rank-width, PhD thesis, Princeton University, 2005
39. Oum S. Rank-width and vertex-minors. J. Combin. Theory Ser. B 95 1 (2005) 79-100
40. S. Oum, Rank-width and well-quasi-ordering, 2005, submitted for publication
41. S. Oum, Approximating rank-width and clique-width quickly. An extended abstract appeared in [37], 2006, submitted for publication
42. Oum S., and Seymour P. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96 (2006) 514-528
43. Oxley J.G. Matroid Theory (1992), Oxford Univ. Press, New York
44. Robertson N., and Seymour P. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7 3 (1986) 309-322
45. Robertson N., and Seymour P. Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B 41 1 (1986) 92-114
46. Robertson N., and Seymour P. Graph minors. IV. Tree-width and well-quasi-ordering. J. Combin. Theory Ser. B 48 2 (1990) 227-254
47. Robertson N., and Seymour P. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 2 (1991) 153-190
48. Robertson N., and Seymour P. Graph minors. XX. Wagner's conjecture. J. Combin. Theory Ser. B 92 2 (2004) 325-357
49. Seese D. The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic 53 2 (1991) 169-195
50. Thatcher J.W., and Wright J.B. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory 2 (1968) 57-81
51. Thomas W. Automata on infinite objects. Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics (1990), Elsevier, Amsterdam 133-191
52. Wanke E. k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54 2-3 (1994) 251-266