A simple formula for the series of constellations and quasi-constellations with boundaries
From MaRDI portal
Publication:405195
zbMath1300.05074arXiv1205.5215MaRDI QIDQ405195
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.5215
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (4)
Generating functions of bipartite maps on orientable surfaces ⋮ Slit-slide-sew bijections for bipartite and quasibipartite plane maps ⋮ Slit-slide-sew bijections for bipartite and quasibipartite plane maps ⋮ Winding of simple walks on the square lattice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on irreducible maps with several boundaries
- Unified bijections for maps with prescribed degrees and girth
- Census of planar maps: From the one-matrix model solution to a combinatorial proof
- Counting surfaces. CRM Aisenstadt chair lectures
- Explicit enumeration of triangulations with multiple boundaries
- Coalescent random forests
- Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
- Enumeration of planar constellations
- Planar maps as labeled mobiles
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Planar Maps are Well Labeled Trees
- Cayley graphs, Cori hypermaps, and dessins d'enfants
- Asymptotic Enumeration of Constellations and Related Families of Maps on Orientable Surfaces
- A Census of Slicings
- A Census of Planar Maps
This page was built for publication: A simple formula for the series of constellations and quasi-constellations with boundaries
