On the Enumeration of Rooted Non-Separable Planar Maps
W. G. Brown, W. T. Tutte
Source record
Source: Crossref
Published: Jan 1, 1964
DOI: 10.4153/cjm-1964-058-7
Open original source ↗Source abstract
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 f i,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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.