Counting rooted maps by genus. III: Nonseparable maps
From MaRDI portal
Publication:1214945
DOI10.1016/0095-8956(75)90050-7zbMath0299.05110OpenAlexW1995036450MaRDI QIDQ1214945
A. B. Lehman, Timothy R. S. Walsh
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90050-7
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps), Hypercartes pointées sur le tore: Décompositions et dénombrements. (Rooted genus one hypermaps on the torus: Decompositions and enumerations), Counting unrooted maps on the plane, The asymptotic number of rooted nonseparable maps on a surface, Chromatic sums of general maps on the sphere and the projective plane, Decompositions of a polygon into centrally symmetric pieces, Permutations with forbidden subsequences and nonseparable planar maps, Feynman diagrams, ribbon graphs, and topological recursion of Eynard-Orantin, Improved enumeration of simple topological graphs, Counting non-isomorphic three-connected planar maps, Unified bijections for maps with prescribed degrees and girth, Joint convergence of random quadrangulations and their cores, The combinatorics of a tree-like functional equation for connected chord diagrams, A bijection between Tamari intervals and extended fighting fish, Simple maps, Hurwitz numbers, and topological recursion, Planar triangulations, bridgeless planar maps and Tamari intervals, Enumeration of \(N\)-rooted maps using quantum field theory, Counting unrooted loopless planar maps, An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps, Enumeration of rooted 4-regular maps without planar loops, The number of rooted essential maps on surfaces, Unnamed Item, Some Asymptotical Estimates for Planar Eulerian Maps, Counting non-isomorphic chord diagrams, Enumeration of Eulerian and unicursal planar maps, On the expected number of perfect matchings in cubic planar graphs, Unnamed Item, Generating Nonisomorphic Maps without Storing Them, The number of loopless planar maps, A survey of the asymptotic behaviour of maps, On functional equations arising from map enumerations, Enumeration on nonseparable planar maps, A pattern for the asymptotic number of rooted maps on surfaces
Cites Work
