MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.03.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2008361472
@@ Property / OpenAlex ID: W2008361472 / 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 @@
+Achromatic number is NP-complete for cographs and interval graphs
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+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 @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Vertex-minors, monadic second-order logic, and a conjecture by Seese
+Normal rank
@@ Property / cites work @@
+Q4850061
@@ Property / cites work: Q4850061 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448752
@@ Property / cites work: Q4448752 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Clique-Width for Graphs of Bounded Tree-Width
+Normal rank
@@ Property / cites work @@
+The first order properties of products of algebraic systems
+Normal rank
@@ Property / cites work @@
+Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
+Normal rank
@@ Property / cites work @@
+Q5572332
@@ Property / cites work: Q5572332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4283244
@@ Property / cites work: Q4283244 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5487903
@@ Property / cites work: Q5487903 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic uses of the Feferman-Vaught theorem
@@ Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic theory of order
@@ Property / cites work: The monadic theory of order / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank