The monadic second-order logic of graphs XVI: Canonical graph decompositions

Logical Methods in Computer Science

Volumn 2, Issue 2, 2006, Pages

  Courcelle, Bruno ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Cliquewidth; Modular decomposition; Monadic second order logic; Split decomposition

Indexed keywords

COMPUTER CIRCUITS; DECOMPOSITION; GRAPHIC METHODS;

2-CONNECTED GRAPHS; CANONICAL GRAPHS; CLIQUE-WIDTH; MODULAR DECOMPOSITION; MONADIC SECOND-ORDER LOGIC; SECOND ORDERS; SPLIT DECOMPOSITION;

FORMAL LOGIC;

EID: 49049112247     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-2(2:2)2006     Document Type: Article

References (32)

1. M. Benedikt and L. Segoufin. Towards a characterization of order-invariant queries over tame structures. In Computer Science Logic 2005, volume 3634 of Oxford, Lec. Notes Comput. Sci. 3634, pages 276-291. S-V, 2005.
2. A. Bouchet. Reducing prime graphs and recognizing circle graphs. Combinatorica, 7:243-254, 1987.
3. C. Capelle. Block decomposition of inheritance hierarchies. In R. Möhring, editor, Proceedings of WG’97, volume 1335 of LNCS, pages 118-131. S-V, 1997.
4. M. Chein, M. Habib, and M. Maurer. Partitive hypergraphs. Discrete mathematics, 37:35-50, 1981.
5. S. Cicerone and G. Stefano. On the extension of bipartite to parity graphs. Discrete Appl. Math., 95:181-195, 1999.
6. B. Courcelle. submitted.
7. B. Courcelle. Monadic second-order graph transductions: A survey. Theoret. Comput. Sci., 126:53-75, 1994.
8. B. Courcelle. The monadic second-order logic of graphs VIII: Orientations. Ann. Pure Appl. Logic, 72:103-143, 1995.
9. B. Courcelle. The monadic second-order logic of graphs X: Linear orderings. Theoret. Comput. Sci., 160:87-143, 1996.
10. B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of graph grammars and computing by graph transformations, volume 1: Foundations, pages 313-400. World Scientific, 1997.
11. B. Courcelle. The monadic second-order logic of graphs XI Hierarchical decompositions of connected graphs. Theoret. Comput. Sci., 224:35-58, 1999.
12. B. Courcelle. The monadic second-order logic of graphs XV: On a Conjecture by D. Seese. J. Appl. Logic, 4:79-114, 2006.
13. B. Courcelle and C. Delhommé. The modular decomposition of countable graphs: Constructions in Monadic Second-Order Logic. In Computer Science Logic 2005, volume 3634 of Oxford, Lec. Notes Comput. Sci., pages 325-338. S-V, 2005.
14. B. Courcelle, J. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computer Systems, 33:125-150, 2000.
15. B. Courcelle and S. Olariu. Upper bounds to the clique-width of graphs. Discrete Appl. Math., 101:77-114, 2000.
16. B. Courcelle and S. Oum. Vertex-minors, monadic second-order logic and a conjecture by Seese. To appear in J. of Combinatorial Theory B.
17. W. Cunnigham. Decomposition of directed graphs. SIAM J. Algebraic Discrete Methods, 3:214-228, 1982.
18. W. Cunnigham and J. Edmonds. A combinatorial decomposition theory. Canad. J. Math, 32:734-765, 1980.
19. F. de Montgolfier. Décomposition modulaire des graphes, Théorie, extensions et algorithmes. PhD thesis, Montpellier 2 University, 2003.
20. A. Ehrenfeucht and R. McConnell. A k-structure generalization of the theory of 2-structures. Theoretical Computer Science, 132:209-227, 1994.
21. C. Gavoille and C. Paul. Distance labeling scheme and split decomposition. Discrete Mathematics, 273:115-130, 2003.
22. M. Habib. Substitution des structures combinatoires, théorie et algorithmes. PhD thesis, Université Paris-6, 1981.
23. M. Habib, M. Huchard, and J. Spinrad. A linear algorithm to decompose inheritance graphs into modules. Algorithmica, 13:573-591, 1995.
24. P. Hlinĕny. On matroid properties definable in the MSO logic. In Mathematical Foundations of Computer Science 2003, volume 2747 of LNCS, pages 470-479. S-V, 2003.
25. J. Hopcroft and R. Tarjan. Isomorphism of planar graphs. In Complexity of computer computations. Plenum Press, New York, 1972.
26. R. Möhring and F. Radermacher. Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Math., 19:257-356, 1984.
27. S. Oum and P. Seymour. Appoximating clique-width and branch-width. 2004, To appear in J. of Combinatorial Theory B.
28. J. Oxley. Matroid theory. Oxford University Press, 1992.
29. J. Spinrad. Efficient graph representations, volume 19 of Fields Institute Monographs. A.M.S., Providence, 2003.
30. K. Truemper. On Whitney’s 2-isomorphism theorem for graphs. J. Graph Theory, 4:43-49, 1980.
31. W. Tutte. Connectivity in graphs. University of Toronto Press, 1966.
32. N. White. Theory of matroids. Cambridge University Press, 1986.