Description trees and Tutte formulas-Reference-Cited by-同舟云学术

Description trees and Tutte formulas

Published:2003-01 Issue:1 Volume:292 Page:165-183
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Cori Robert,Schaeffer Gilles

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. Counting rooted maps on a surface;Arques;Theoret. Comput. Sci.,2000

2. M.D. Atkinson, M.M. Murphy, N. Rušuc, Sorting with two ordered stacks in series, 2000, submitted for publication.

3. C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, D. Gouyou-Beauchamps, Generating functions for generating trees, 2000, in preparation.

4. Exact enumeration of 1342-avoiding permutations, a close link with labeled trees and planar maps;Bóna;J. Combin. Theory Ser. A,1997

5. M. Bousquet-Mélou, Multi-statistic enumeration of two-stack sortable permutations, Electron. J. Combin. 5 (1) (1998), Research Paper 21, 12pp. (electronic), MR 99b:05001.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On ordering of β-description trees;Theoretical Computer Science;2024-01

2. Parking on Cayley trees and frozen Erdős–Rényi;The Annals of Probability;2023-11-01

3. Bijections between planar maps and planar linear normal λ-terms with connectivity condition;Advances in Applied Mathematics;2023-07

4. Bijective link between Chapoton’s new intervals and bipartite planar maps;European Journal of Combinatorics;2021-10

5. Unitarily invariant valuations and Tutte’s sequence;Proceedings of the American Mathematical Society;2020-12-14