Labelled well-quasi-order for permutation classes (Q5051473): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q696812
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vincent R. Vatter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2103.08243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations and pattern restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates for subclasses of Av(321) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric grid classes of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising inflations of monotone grid classes of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular closed sets of permutations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $2\times 2$ monotone grid classes are finitely based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationality for subclasses of 321-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter Graphs and Geometric Grid Classes of Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelled induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter graphs and geometric grid classes of permutations: characterization and recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter graphs and geometric grid classes of permutations: characterization and recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially well-ordered closed sets of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution-closed pattern classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inflations of geometric grid classes of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations which are the union of an increasing and a decreasing subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs without star forests and related graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and enumerating 321-avoiding and skew-merged simple permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample regarding labelled well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wreath products of permutation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid classes and partial well order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations: Decidability and unavoidable substructures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of a theorem of Schmerl and Trotter for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden substructures and combinatorial dichotomies: WQO and universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-order of relabel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The X-class and almost-increasing permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Partial Well-Ordering of Sets of Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Graphs Having Dilworth Number Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness theorems for graphs and posets obtained by compositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Matching for 321-Avoiding Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi-order in combinatorics: embeddings and homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid classes and the Fibonacci dichotomy for restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraph isomorphism on proper interval and bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5594621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two forbidden induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary properties of well-quasi-ordered sets of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a chain graph in a bipartite permutation graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3984103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: On well-quasi-ordering finite structures with labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphism Groups of Geometrically Represented Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fraissé's order type conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-orderings and sets of finite sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for counting independent sets in bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical antichains of unit interval and bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-ordering versus clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs with application to the minimum buffer size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance in coloured permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of BQO Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 321-polygon-avoiding permutations and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profile classes and partial well-order for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter graphs and well-quasi-order by induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The depth of a permutation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial well‐ordering of sets of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3495358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-theoretic investigations on Kruskal's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite antichain of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit enumeration of 321, hexagon-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Using Networks of Queues and Stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance and the Bruhat order. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear structure of bipartite permutation graphs and the longest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small permutation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Enumerative Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates of permutation classes: from countable to uncountable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partial well-order for monotone grid classes of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank

Latest revision as of 22:02, 30 July 2024

scientific article; zbMATH DE number 7622539
Language Label Description Also known as
English
Labelled well-quasi-order for permutation classes
scientific article; zbMATH DE number 7622539

    Statements

    Labelled well-quasi-order for permutation classes (English)
    0 references
    0 references
    0 references
    23 November 2022
    0 references
    labelled well-quasi-order
    0 references
    permutation patterns
    0 references
    well-quasi-order
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers