Clique-width of countable graphs: A compactness property

Discrete Mathematics

Volumn 276, Issue 1-3, 2004, Pages 127-148

  Courcelle, B ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Clique width; Countable graph; Logic

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NUMERICAL ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

FINITE GRAPHS; GRAPH DECOMPOSITION;

TREES (MATHEMATICS);

EID: 0347415782     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00303-0     Document Type: Conference Paper

References (14)

1. Bodlaender H. A partial. k -arboretum of graphs with bounded tree-width Theoret. Comput. Sci. 209:1998;1-45.
2. Courcelle B. Frontiers of infinite trees. RAIRO Inform. Theoret. 12:1978;319-337.
3. Courcelle B. Fundamental properties of infinite trees. Theoret. Comput. Sci. 25:1983;95-169.
4. Courcelle B. The monadic second-order logic of graphs X. linear orderings Theoret. Comput. Sci. 160:1996;87-143.
5. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 1, Foundations, World Scientific, London, 1997, pp. 313-400 (Chapter 5).
6. Courcelle B. The monadic second-order logic of graphs XIV. uniformly sparse graphs and edge set quantifications Theoret. Comput. Sci. 299:2003;1-36.
7. Courcelle B., Makowsky J., Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Systems. 33:2000;125-150.
8. Courcelle B., Makowsky J., Rotics U. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math. 108:2001;23-52.
9. Courcelle B., Olariu S. Upper bounds to the clique-width of graphs. Discrete Appl. Math. 101:2000;77-114.
10. Robertson N., Seymour P. Graph minors I, excluding a forest. J. Combin. Theory B. 35:1983;39-61.
11. Robertson N., Seymour P. Graph minors V, excluding a planar graph. J. Combin. Theory B. 41:1986;92-114.
12. Robertson N., Seymour P. Graph minors X, obstructions to tree-decomposition. J. Combin. Theory B. 52:1991;153-190.
13. Seese D. The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic. 53:1991;169-195.
14. Thomassen C. Configurations in graphs of large minimum degree, connectivity or chromatic number. Bloom G.S., et al. Combinatorial Mathematics. Proceedings of the Third International Conference. Vol. 555:1989;402-411 Annals of the New York Academy of Sciences, New York.