Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323): Difference between revisions

@@ Property / Wikidata QID @@
+Q59567455
@@ Property / Wikidata QID: Q59567455 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
+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. VIII: Orientations
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Definability Equals Recognizability for $k$-Outerplanar Graphs
+Normal rank
@@ Property / cites work @@
+Recognizability equals definability for partial k-paths
+Normal rank
@@ Property / cites work @@
+Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Q4381404
@@ Property / cites work: Q4381404 / rank @@
+Normal rank