A model-theoretic characterisation of clique width (Q2503407): Difference between revisions

@@ Property / cites work @@
+Second-order quantifiers and the complexity of theories
+Normal rank
@@ Property / cites work @@
+The undecidability of the domino problem
@@ Property / cites work: The undecidability of the domino problem / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizability, hypergraph operations, and logical types
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VII: Graphs as relational structures
+Normal rank
@@ Property / cites work @@
+Clique-width of countable graphs: A compactness property.
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-minors, monadic second-order logic, and a conjecture by Seese
+Normal rank
@@ Property / cites work @@
+Q4736878
@@ Property / cites work: Q4736878 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+Théories d'arbres
@@ Property / cites work: Théories d'arbres / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5668796
@@ Property / cites work: Q5668796 / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of the models of decidable monadic theories of graphs
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank