Recognizable sets of graphs of bounded tree-width (Q5096279): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-57787-4_9
+Normal rank
@@ Property / OpenAlex ID @@
+W1506348042
@@ Property / OpenAlex ID: W1506348042 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273870
@@ Property / cites work: Q4273870 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037299
@@ Property / cites work: Q4037299 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+Recognizable sets of graphs: equivalent definitions and closure properties
+Normal rank
@@ Property / cites work @@
+Q3486868
@@ Property / cites work: Q3486868 / rank @@
+Normal rank