论文信息 - Clique-width of countable graphs: a compactness property - 字舞流文

Clique-width of countable graphs: a compactness property

Abstract We define the clique-width of a countable graph. We prove that a countable graph has finite clique-width iff its finite induced subgraphs have clique-width at most k for some integer k.

Bruno Courcelle

[1] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[2] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[3] Bruno Courcelle,et al. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..

[4] Bruno Courcelle,et al. The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[5] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[6] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[7] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs X: Linear Orderings , 1996, Theor. Comput. Sci..

[8] Carsten Thomassen,et al. Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number , 1989 .

[9] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[10] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..