Indexed metadata

Enumeration of Non-Separable Planar Maps

William G. Brown

Source record

Source: Crossref

Published: Jan 1, 1963

DOI: 10.4153/cjm-1963-056-7

Open original source ↗

Source abstract

In (2), Tutte has shown that the number, B n , of rooted non-separable planar maps having n edges is [2(3n — 3)!]/[n! (2n — 1)!]. Rooting was accomplished by designating one edge as the root, orienting it, and distinguishing between its sides as left and right . We shall here compute the number, B n,m , of rooted non-separable planar maps having n edges and such that the face to the left of the root is incident with exactly m edges, which maps will be said to be of type [ n, m ].

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.