A counterexample regarding labelled well-quasi-ordering (Q1756107): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-018-1962-0
@@ Property / DOI: 10.1007/s00373-018-1962-0 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.10042
@@ Property / arXiv ID: 1709.10042 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124846948
@@ Property / Wikidata QID: Q124846948 / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted permutations
@@ Property / cites work: Restricted permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+Labelled induced subgraphs and well-quasi-ordering
+Normal rank
@@ Property / cites work @@
+Q3911404
@@ Property / cites work: Q3911404 / rank @@
+Normal rank
@@ Property / cites work @@
+Split graphs of Dilworth number 2
@@ Property / cites work: Split graphs of Dilworth number 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Pattern matching for permutations
@@ Property / cites work: Pattern matching for permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing simple permutations, with enumerative consequences
+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 @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Split Graphs Having Dilworth Number Two
@@ Property / cites work: Split Graphs Having Dilworth Number Two / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+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 @@
+Well quasi-order in combinatorics: embeddings and homomorphisms
+Normal rank
@@ Property / cites work @@
+Split permutation graphs
@@ Property / cites work: Split permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary properties of well-quasi-ordered sets of graphs
+Normal rank
@@ Property / cites work @@
+Q5668845
@@ Property / cites work: Q5668845 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden subsequences
@@ Property / cites work: Forbidden subsequences / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation classes
@@ Property / cites work: Permutation classes / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00373-018-1962-0
@@ Property / DOI: 10.1007/S00373-018-1962-0 / rank @@
+Normal rank