A new graph construction of unbounded clique-width (Q509276): Difference between revisions

@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Q4425939
@@ Property / cites work: Q4425939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463359
@@ Property / cites work: Q5463359 / rank @@
+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 @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite Graphs of Large Clique-Width
@@ Property / cites work: Bipartite Graphs of Large Clique-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Q5487903
@@ Property / cites work: Q5487903 / rank @@
+Normal rank
@@ Property / cites work @@
+THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
+Normal rank
@@ Property / cites work @@
+Minimal classes of graphs of unbounded clique-width
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank