Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Mullin, R. C.
1966.
On the Average Number of Trees in Certain Maps.
Canadian Journal of Mathematics,
Vol. 18,
Issue. ,
p.
33.
Klarner, David A.
1970.
Correspondences between plane trees and binary sequences.
Journal of Combinatorial Theory,
Vol. 9,
Issue. 4,
p.
401.
Cori, Robert
and
Richard, Jean
1972.
Enumeration des graphes planaires a l'aide des series formelles en variables non commutatives.
Discrete Mathematics,
Vol. 2,
Issue. 2,
p.
115.
Tutte, W. T.
1978.
Theory and Applications of Graphs.
Vol. 642,
Issue. ,
p.
590.
MOHANTY, GOPAL
1979.
Lattice Path Counting and Applications.
p.
127.
Rathie, Pushpa N.
1980.
Combinatorial Mathematics, Optimal Designs and Their Applications.
Vol. 6,
Issue. ,
p.
281.
Tutte, W.T.
1982.
Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday.
Vol. 60,
Issue. ,
p.
243.
Yanpei, Liu
1985.
Enumerating rooted loopless planar maps.
Acta Mathematicae Applicatae Sinica,
Vol. 2,
Issue. 1,
p.
14.
Yanpei, Liu
1985.
Enumerating rooted simple planar maps.
Acta Mathematicae Applicatae Sinica,
Vol. 2,
Issue. 2,
p.
101.
Bender, Edward A
and
Richmond, L.Bruce
1986.
A survey of the asymptotic behaviour of maps.
Journal of Combinatorial Theory, Series B,
Vol. 40,
Issue. 3,
p.
297.
Gao, Zhi-Cheng
1991.
The number of rooted triangular maps on a surface.
Journal of Combinatorial Theory, Series B,
Vol. 52,
Issue. 2,
p.
236.
Gao, Zhicheng
and
Wang, Jianyu
1999.
Enumeration of Rooted Planar Triangulations with Respect to Diagonal Flips.
Journal of Combinatorial Theory, Series A,
Vol. 88,
Issue. 2,
p.
276.
Ren, Han
and
Liu, Yanpeu
2000.
On the Number of Fair Triangulations.
Acta Mathematica Sinica, English Series,
Vol. 16,
Issue. 1,
p.
79.
Ren, Han
and
Liu, Yanpei
2000.
COUNTING FAIR NEAR-TRIANGULATIONS ON THE DISC.
Acta Mathematica Scientia,
Vol. 20,
Issue. 1,
p.
49.
Gao, Zhicheng J.
Wanless, Ian M.
and
Wormald, Nicholas C.
2001.
Counting 5‐connected planar triangulations.
Journal of Graph Theory,
Vol. 38,
Issue. 1,
p.
18.
Hao, Rongxia
Cai, Junliang
and
Liu, Yanpei
2002.
Couningg-essential maps on surfaces with small genera.
Journal of Applied Mathematics and Computing,
Vol. 9,
Issue. 2,
p.
451.
Poulalhon, Dominique
and
Schaeffer, Gilles
2003.
A bijection for triangulations of a polygon with interior points and multiple edges.
Theoretical Computer Science,
Vol. 307,
Issue. 2,
p.
385.
Liu, Wenzhong
Liu, Yanpei
and
Xu, Yan
2007.
A census of boundary cubic rooted planar maps.
Discrete Applied Mathematics,
Vol. 155,
Issue. 13,
p.
1678.
Bernardi, Olivier
2007.
Bijective counting of Kreweras walks and loopless triangulations.
Journal of Combinatorial Theory, Series A,
Vol. 114,
Issue. 5,
p.
931.
ZhangYongli
Liu, Yanpei
and
CaiJunliang
2011.
A equation for enumerating loopless unicursal maps.
p.
1.