Hostname: page-component-8448b6f56d-sxzjt Total loading time: 0 Render date: 2024-04-23T10:15:33.942Z Has data issue: false hasContentIssue false

On the Enumeration of Rooted Non-Separable Planar Maps

Published online by Cambridge University Press:  20 November 2018

W. G. Brown
Affiliation:
University of British Columbia and University of Waterloo
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

It has been shown elsewhere (1, 4) that the number of rooted non-separable planar maps with n edges is

In the present paper we improve upon this result by finding the number fi,j of rooted non-separable planar maps with i + 1 vertices and j + 1 faces. We use the definitions of (1).

Among the non-separable planar maps only the loop-map and the link-map have i = 0 or j = 0. We therefore confine our attention to the case in which i and j are both positive.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1964

References

1. Brown, W. G., Enumeration of non-separable planar maps, Can. J. Math., 15 (1963), 526 545.Google Scholar
2. Good, I. J., Generalizations to several variables of Lagrange's expansion, with applications to stochastic processes, Proc. Camb. Phil. Soc, 56 (1960), 367380.Google Scholar
3. Goursat, E., A course in mathematical analysis, I and II, Part I (Boston, 1904 and 1916).Google Scholar
4. Tutte, W. T., A census of planar maps, Can. J. Math., 15 (1963), 249271.Google Scholar