The monadic second-order logic of graphs XV: On a conjecture by D. Seese

Journal of Applied Logic

Volumn 4, Issue 1, 2006, Pages 79-114

  Courcelle, Bruno ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Clique width; Comparability graph; Decidable theory; Graph; Interval graph; Line graph; Monadic second order logic; Monadic second order transduction

Indexed keywords

GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS;

CLIQUE-WIDTH; DECIDABLE THEORY; INTERVAL GRAPH; LINE GRAPH; MONADIC SECOND-ORDER LOGIC; MONADIC SECOND-ORDER TRANSDUCTION;

FORMAL LOGIC;

EID: 27944433098     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2005.08.004     Document Type: Article

References (38)

1. H. Bodlaender A partial k-arboretum of graphs with bounded treewidth Theoret. Comput. Sci. 209 1998 1 45
2. A. Brandstädt, Van Bang Le, and J. Spinrad Graph Classes, a Survey Monographs on Discrete Mathematics 1999 SIAM
3. B. Courcelle The monadic second-order logic of graphs II: Infinite graphs of bounded width Math. Syst. Theory 21 1989 187 221
4. B. Courcelle The monadic second-order logic of graphs V: On closing the gap between definability and recognizability Theoret. Comput. Sci. 80 1991 153 202
5. B. Courcelle The monadic second-order logic of graphs VI: On several representations of graphs by relational structures Discrete Appl. Math. 54 1994 117 149 Corrections in Discrete Appl. Math. 63 1995 199 200
6. B. Courcelle The monadic second-order logic of graphs VI: On several representations of graphs by relational structures Discrete Appl. Math. 54 1994 117 149 Corrections in Discrete Appl. Math. 63 1995 199 200
7. B. Courcelle Monadic second-order graph transductions: A survey Theoret. Comput. Sci. 126 1994 53 75
8. B. Courcelle The monadic second-order logic of graphs VIII: Orientations Ann. Pure Appl. Logic 72 1995 103 143
9. B. Courcelle The monadic second-order logic of graphs X: Linear orders Theoret. Comput. Sci. 160 1996 87 143
10. B. Courcelle The expression of graph properties and graph transformations in monadic second-order logic G. Rozenberg Handbook of Graph Grammars and Computing by Graph Transformations, vol. 1: Foundations 1997 World Scientific Singapore 313 400
11. B. Courcelle A monadic second-order definition of the structure of convex hypergraphs Inform. Comput. 178 2002 391 411
12. B. Courcelle The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications Theoret. Comput. Sci. 299 2003 1 36
13. B. Courcelle Clique-width of countable graphs: A compactness property Discrete Math. 276 2004 127 148
14. B. Courcelle, and J. Engelfriet A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars Math. Syst. Theory 28 1995 515 552
15. B. Courcelle, and J. Makowsky Fusion in relational structures and the verification of monadic second-order properties Math. Struct. Comp. Sci. 12 2002 203 235
16. B. Courcelle, J. Makowsky, and U. Rotics Linear time solvable optimization problems on graphs of bounded clique-width Theory Comput. Syst. 33 2000 125 150
17. B. Courcelle, and S. Olariu Upper bounds to the clique-width of graphs Discrete Appl. Math. 101 2000 77 114
18. B. Courcelle, S. Oum, Vertex-minors, monadic second-order logic and a conjecture by Seese, July 2004, submitted for publication, http://www.labri.fr/ ~courcell
19. R. Diestel Graph Theory 2000 Springer Berlin freely readable on http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/
20. R. Diestel, T. Jensen, K. Gorbunov, and C. Thomassen Highly connected sets and the excluded grid theorem J. Combin. Theory Ser. B 75 1999 61 73
21. J. Engelfriet, and V. van Oostrom Logical description of context-free graph-languages J. Comput. System Sci. 55 1997 489 503
22. M. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
23. F. Gurski, E. Wanke, Line graphs of bounded clique-width, Preprint, 2004
24. M. Habib, and R. Jegou N-free posets as generalizations of series-parallel posets Discrete Appl. Math. 12 1985 279 291
25. C. Heuchenne Sur une certaine correspondance entre graphes Bull. Soc. Roy. Sci. (Liége, Belgium) 33 1964 743 753
26. D. Kelly Comparability graphs I. Rival Graphs and Order 1985 Reidel Dordrecht 3 40
27. D. Lapoire Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width Proceedings of STACS 98 Lecture Notes Comput. Sci. vol. 1373 1998 Springer Berlin 618 628
28. R. Mohring Computationally tractable classes of ordered sets I. Rival Algorithms and Order 1989 Kluwer Academic Dordrecht 105 194
29. R. Mohring, and F. Radermacher Substitution decomposition for discrete structures and connections with combinatorial optimization Ann. Discrete Math. 19 1984 257 356
30. M. Rabin Decidability of second-order theories and automata on infinite trees Trans. Amer. Math. Soc. 141 1969 1 35
31. N. Robertson, and P. Seymour Graph Minors V, Excluding a planar graph J. Combin. Theory Ser. B 41 1986 92 114
32. D. Seese The structure of the models of decidable monadic theories of graphs Ann. Pure Appl. Logic 53 1991 169 195
33. D. Seese Interpretability and tree-automata: A simple way to solve algorithmic problems on graphs closely related to trees M. Nivat A. Podelski Tree Automata and Languages 1992 Elsevier Science Amsterdam 83 114
34. J. Spinrad Efficient Graph Representations Fields Institute Monographs vol. 19 2003 American Mathematical Society Providence, RI
35. W. Trotter Combinatorics and Partially Ordered Sets - Dimension Theory 1992 J. Hopkins University Press Baltimore, MD
36. W. Trotter, and J. Moore Characterization problems for graphs, partially ordered sets, lattices, and families of sets Discrete Math. 16 1976 361 381
37. H. Whitney Congruent graphs and the connectivity of graphs Amer. J. Math. 54 1932 150 168
38. H. Wilf Generating Functionology 1994 Academic Press New York freely readable on http://www.math.brupenn.edu/~wilf/DownldGF.html