Substitution-closed pattern classes

DOI10.1016/J.JCTA.2010.10.006zbMATH Open1231.05002OpenAlexW1997481241MaRDI QIDQ618290FDOQ618290

Sumit K. Garg

Publication date: 14 January 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.10.006

zbMATH Keywords

permutationsubstitutionbasispattern class

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Extension of hereditary classes with substitutions
• Normal hypergraphs and the perfect graph conjecture
• Title not available (Why is that?)
• Simple permutations: Decidability and unavoidable substructures
• Simple permutations and pattern restricted permutations
• Wreath products of permutation classes
• Simple permutations and algebraic generating functions
• On the closure of graphs under substitution
• Basic perfect graphs and their extensions
• A characterization of domination reducible graphs
• Decomposing simple permutations, with enumerative consequences
• A finiteness theorem for primal extensions
• The set of prime extensions of a graph: the finite and the infinite case
• On minimal prime extensions of a four-vertex graph in a prime graph
• All minimal prime extensions of hereditary classes of graphs

Cited In (3)

• Universal limits of substitution-closed permutation classes
• Labelled well-quasi-order for permutation classes
• Title not available (Why is that?)

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)