A comparison of compatible, finite, and inductive graph properties (Q1812942): Difference between revisions

@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph expressions and graph rewritings
@@ Property / cites work: Graph expressions and graph rewritings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785987
@@ Property / cites work: Q3785987 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Plex languages
@@ Property / cites work: Plex languages / rank @@
+Normal rank
@@ Property / cites work @@
+Hyperedge replacement: grammars and languages
@@ Property / cites work: Hyperedge replacement: grammars and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3774975
@@ Property / cites work: Q3774975 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4694766
@@ Property / cites work: Q4694766 / rank @@
+Normal rank
@@ Property / cites work @@
+Metatheorems for decision problems on hyperedge replacement graph languages
+Normal rank
@@ Property / cites work @@
+Q4711083
@@ Property / cites work: Q4711083 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795251
@@ Property / cites work: Q3795251 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995732
@@ Property / cites work: Q3995732 / rank @@
+Normal rank