Counting planar maps, coloured or uncoloured
From MaRDI portal
Publication:3089366
zbMath1244.05118arXiv2004.08792MaRDI QIDQ3089366
Publication date: 24 August 2011
Full work available at URL: https://arxiv.org/abs/2004.08792
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (12)
Counting coloured planar maps: differential equations ⋮ An elementary solution of Gessel's walks in the quadrant ⋮ Bipolar orientations on planar maps and \(\mathrm{SLE}_{12}\) ⋮ Product-coproduct prographs and triangulations of the sphere ⋮ On the enumeration of plane bipolar posets and transversal structures ⋮ Critical behaviour of spanning forests on random planar graphs ⋮ Spanning forests in regular planar maps ⋮ Critical Ising model on random triangulations of the disk: enumeration and local limits ⋮ Precision measurements of Hausdorff dimensions in two-dimensional quantum gravity ⋮ Tree-decorated planar maps ⋮ Enumeration of rooted 3-connected bipartite planar maps ⋮ Concurrency theorems for non-linear rewriting theories
Uses Software
This page was built for publication: Counting planar maps, coloured or uncoloured
