A bijective census of nonseparable planar maps (Q1268599)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1212908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bijective census of nonseparable planar maps |
scientific article; zbMATH DE number 1212908 |
Statements
A bijective census of nonseparable planar maps (English)
0 references
19 July 1999
0 references
An embedding of a connected graph in the sphere is called a planar map if it partitions the sphere into simply connected regions. A nonseparable planar map is a planar map without cut vertices and loop edges. The paper considers bijections between nonseparable planar maps and different kinds of trees and derives enumerations and random generations.
0 references
planar map
0 references
enumerations
0 references
0 references
0.8366133570671082
0 references
0.8272490501403809
0 references
0.826678454875946
0 references
0.8253127932548523
0 references
