Substitution-closed pattern classes

[1]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[2]  Vassilis Giakoumakis,et al.  On the closure of graphs under substitution , 1997, Discret. Math..

[3]  M. Atkinson,et al.  The enumeration of simple permutations. , 2003, math/0304213.

[4]  Igor E. Zverovich.  Extension of Hereditary Classes with Substitutions , 2003, Discret. Appl. Math..

[5]  Andreas Brandstädt,et al.  On minimal prime extensions of a four-vertex graph in a prime graph , 2004, Discret. Math..

[6]  Igor Ed. Zverovich.  A Characterization of Domination Reducible Graphs , 2004, Graphs Comb..

[7]  Stephan Olariu,et al.  The set of prime extensions of a graph: the finite and the infinite case , 2004, Electron. Notes Discret. Math..

[8]  Mike D. Atkinson,et al.  Simple permutations and pattern restricted permutations , 2005, Discret. Math..

[9]  Igor E. Zverovich.  A finiteness theorem for primal extensions , 2005, Discret. Math..

[10]  Vadim E. Zverovich,et al.  Basic perfect graphs and their extensions , 2005, Discret. Math..

[11]  Stephan Olariu,et al.  All minimal prime extensions of hereditary classes of graphs , 2007, Theor. Comput. Sci..

[12]  Robert Brignall.  Wreath Products of Permutation Classes , 2007, Electron. J. Comb..

[13]  Nikola Ruskuc,et al.  Simple permutations: Decidability and unavoidable substructures , 2008, Theor. Comput. Sci..

[14]  Robert Brignall,et al.  Simple permutations and algebraic generating functions , 2006, J. Comb. Theory A.

[15]  Robert Brignall,et al.  Decomposing simple permutations, with enumerative consequences , 2008, Comb..