Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822): Difference between revisions

@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Well-quasi-order of relabel functions
@@ Property / cites work: Well-quasi-order of relabel functions / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subgraphs and well‐quasi‐ordering
@@ Property / cites work: Induced subgraphs and well‐quasi‐ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-structured transition systems everywhere!
@@ Property / cites work: Well-structured transition systems everywhere! / rank @@
+Normal rank
@@ Property / cites work @@
+On the relationship between NLC-width and linear NLC-width
+Normal rank
@@ Property / cites work @@
+Ordering by Divisibility in Abstract Algebras
@@ Property / cites work: Ordering by Divisibility in Abstract Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Two forbidden induced subgraphs and well-quasi-ordering
+Normal rank
@@ Property / cites work @@
+The theory of well-quasi-ordering: a frequently discovered concept
+Normal rank
@@ Property / cites work @@
+The relative clique-width of a graph
@@ Property / cites work: The relative clique-width of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Letter graphs and well-quasi-order by induced subgraphs
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank