Definability equals recognizability for $k$-outerplanar graphs and $l$-chordal partial $k$-trees (Q2403697): Difference between revisions

@@ Property / cites work @@
+Q4273870
@@ Property / cites work: Q4273870 / 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 @@
+Trees in Polyhedral Graphs
@@ Property / cites work: Trees in Polyhedral Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Myhill-Nerode Methods for Hypergraphs
@@ Property / cites work: Myhill-Nerode Methods for Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic second-order definable graph orderings
@@ Property / cites work: Monadic second-order definable graph orderings / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Recognizability equals definability for graphs of bounded treewidth and bounded chordality
+Normal rank
@@ Property / cites work @@
+Safe separators for treewidth
@@ Property / cites work: Safe separators for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Definability equals recognizability for graphs of bounded treewidth
+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 @@
+Weak Second‐Order Arithmetic and Finite Automata
+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. VI: On several representations of graphs by relational structures
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VIII: Orientations
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. X: Linear orderings
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. XII: Planar graphs and planar maps
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / 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
@@ Property / cites work @@
+Linear Automaton Transformations
@@ Property / cites work: Linear Automaton Transformations / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+Characterizations of outerplanar graphs
@@ Property / cites work: Characterizations of outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5524326
@@ Property / cites work: Q5524326 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216652
@@ Property / cites work: Q3216652 / rank @@
+Normal rank
@@ Property / cites work @@
+Über eine Eigenschaft der ebenen Komplexe
@@ Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank @@
+Normal rank
@@ Property / cites work @@
+Congruent Graphs and the Connectivity of Graphs
@@ Property / cites work: Congruent Graphs and the Connectivity of Graphs / rank @@
+Normal rank

Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697): Difference between revisions

Latest revision as of 08:56, 14 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)