J. Backelin, J. West, and G. Xin, Wilf-equivalence for singleton classes, Advances in Applied Mathematics, vol.38, issue.2, pp.133-148, 2007.
DOI : 10.1016/j.aam.2004.11.006
URL : http://doi.org/10.1016/j.aam.2004.11.006

J. Bloom and S. Elizalde, Pattern avoidance in matchings and partitions, preprint

J. Bloom and D. Saracino, A simple bijection between 231-avoiding and 312-avoiding placements, J. Combin. Math. Combin. Comput

M. Bóna, Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps, Journal of Combinatorial Theory, Series A, vol.80, issue.2, pp.257-272, 1997.
DOI : 10.1006/jcta.1997.2800

M. Bousquet-mélou and G. Xin, On partitions avoiding 3-crossings, Sém, Art. B54e, p.pp, 2005.

S. Burrill, S. Elizalde, M. Mishna, and L. Yen, A generating tree approach to k-nonnesting partitions and permutations, preprint

W. Chen, E. Deng, R. Du, R. Stanley, and C. Yan, Crossings and nestings of matchings and partitions, Transactions of the American Mathematical Society, vol.359, issue.04, pp.1555-1575, 2007.
DOI : 10.1090/S0002-9947-06-04210-3

A. Claesson, V. Jelínek, and E. Steingrímsson, Upper bounds for the Stanley???Wilf limit of 1324 and other layered patterns, Journal of Combinatorial Theory, Series A, vol.119, issue.8, pp.1680-1691, 2012.
DOI : 10.1016/j.jcta.2012.05.006

A. De-mier, k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams, Electronic Notes in Discrete Mathematics, vol.28, pp.699-720, 2007.
DOI : 10.1016/j.endm.2007.01.002

S. Elizalde and I. Pak, Bijections for refined restricted permutations, Journal of Combinatorial Theory, Series A, vol.105, issue.2, pp.207-219, 2004.
DOI : 10.1016/j.jcta.2003.10.009

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

D. Gouyou-beauchamps, Standard Young Tableaux of Height 4 and 5, European Journal of Combinatorics, vol.10, issue.1, pp.69-82, 1989.
DOI : 10.1016/S0195-6698(89)80034-4

V. Jelínek, Dyck paths and pattern-avoiding matchings, European Journal of Combinatorics, vol.28, issue.1, pp.202-213, 2007.
DOI : 10.1016/j.ejc.2005.07.013

M. Klazar, On abab-free and abba-free Set Partitions, European Journal of Combinatorics, vol.17, issue.1, pp.53-68, 1996.
DOI : 10.1006/eujc.1996.0005

C. Krattenthaler, Permutations with Restricted Patterns and Dyck Paths, Advances in Applied Mathematics, vol.27, issue.2-3, pp.510-530, 2001.
DOI : 10.1006/aama.2001.0747

C. Krattenthaler, Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes, Advances in Applied Mathematics, vol.37, issue.3, pp.404-431, 2006.
DOI : 10.1016/j.aam.2005.12.006

B. E. Sagan, Pattern avoidance in set partitions, Ars Combin, vol.94, pp.79-96, 2010.

Z. Stankova, Shape-Wilf-Ordering on Permutations of Length 3, Elec. J. Combin, vol.14, p.56, 2007.

Z. Stankova and J. West, A new class of Wilf-equivalent permutations, Journal of Algebraic Combinatorics, vol.15, issue.3, pp.271-290, 2002.
DOI : 10.1023/A:1015016625432

W. T. Tutte, A census of planar maps, Canad, J. Math, vol.15, pp.249-271, 1963.