A bijective census of nonseparable planar maps
type: Item
instance of: scholarly article
title: A bijective census of nonseparable planar maps
zbMATH Open document ID: 0916.05037
author: Benjamin Jacquard
author: Gilles Schaeffer
published in: Journal of Combinatorial Theory. Series A
publication date: 1999-07-19T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1212908
zbMATH Keywords: planar map
zbMATH Keywords: enumerations
reviewed by: Dietmar Cieslik
MaRDI profile type: Publication
OpenAlex ID: W1981761788
cites work: Enumeration of Non-Separable Planar Maps
cites work: On the Enumeration of Rooted Non-Separable Planar Maps
cites work: Q4071773
cites work: A combinatorial proof of J. West's conjecture
cites work: Q3669422
cites work: Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
cites work: Q4057549
cites work: Q4529547
cites work: Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
cites work: A Census of Planar Maps
cites work: A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
Wikidata QID: Q114234209
DOI: 10.1006/JCTA.1997.2852
description: scientific article; zbMATH DE number 1212908