11 citations found. Retrieving documents...
Miklos Bona. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A, 80(2):257--272, 1997.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
A Survey of Stack-Sorting Disciplines - Bona (2003)   Self-citation (Bona)   (Correct)

No context found.

M. Bona, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar graphs, J. Combin. Theory Ser. A, 80 (1997), 257--272.


On the Wilf-Stanley limit of 4231-avoiding.. - Albert, Elder.. (2005)   (Correct)

No context found.

Miklos Bona. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A, 80(2):257--272, 1997.


Unknown - (2003)   (Correct)

No context found.

Miklos Bona. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A, 80(2):257--272, 1997.


Four Classes of Pattern-Avoiding Permutations under one Roof: .. - Bousquet-Melou (2003)   (Correct)

No context found.

M. Bona. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A, 80(2):257--272, 1997.


On Growth Rates of Hereditary Permutation Classes - Kaiser, Klazar (2002)   (Correct)

No context found.

M. B'ona, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps, J. Comb. Theory, Ser. A, 80 (1997), 257--272.


On Growth Rates of Closed Permutation Classes - Kaiser, Klazar (2003)   (Correct)

No context found.

M. Bona, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps, J. Comb. Theory, Ser. A, 80 (1997), 257--272.


Counting Occurrences Of A Pattern Of Type (1,2) or (2,1) in.. - Claesson, Mansour (2002)   (Correct)

No context found.

M. B'ona. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A, 80(2):257--272, 1997.


Counting pattern-free set partitions I: A generalization of.. - Klazar (2000)   (Correct)

No context found.

M. B'ona, Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps, J. Combinatorial Th. Series A 80 (1997), 257--272.


Simple Permutations and Pattern Restricted Permutations - Atkinson, Albert (2003)   (2 citations)  (Correct)

No context found.

Miklos Bona. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A, 80(2):257--272, 1997.


Counting Occurences of 132 in an Even Permutation - Mansour (2004)   (Correct)

No context found.

M. Bona. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A, 80(2):257--272, 1997.


Counting 1324-avoiding Permutations - Marinov, Radoicic (2003)   (1 citation)  (Correct)

No context found.

Miklos Bona, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps, J. Combin. Theory Ser. A 80 (1997), no. 2, 257--272.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC