Substitution-closed pattern classes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2186865 (Why is no real title available?)
- A characterization of domination reducible graphs
- A finiteness theorem for primal extensions
- All minimal prime extensions of hereditary classes of graphs
- Basic perfect graphs and their extensions
- Decomposing simple permutations, with enumerative consequences
- Extension of hereditary classes with substitutions
- Normal hypergraphs and the perfect graph conjecture
- On minimal prime extensions of a four-vertex graph in a prime graph
- On the closure of graphs under substitution
- Simple permutations and algebraic generating functions
- Simple permutations and pattern restricted permutations
- Simple permutations: Decidability and unavoidable substructures
- The set of prime extensions of a graph: the finite and the infinite case
- Wreath products of permutation classes
Cited in
(7)- Pattern avoidance classes and subpermutations
- Pattern classes of permutations via bijections between linearly ordered sets
- Isomorphisms between pattern classes
- Labelled well-quasi-order for permutation classes
- Sorting classes
- scientific article; zbMATH DE number 1507230 (Why is no real title available?)
- Universal limits of substitution-closed permutation classes
This page was built for publication: Substitution-closed pattern classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618290)