The following pages link to A Census of Planar Maps (Q5723653):
Displaying 50 items.
- The peeling process of infinite Boltzmann planar maps (Q252830) (← links)
- Liouville quantum gravity on the Riemann sphere (Q261622) (← links)
- Random infinite squarings of rectangles (Q297439) (← links)
- Free analysis and random matrices (Q311170) (← links)
- Generating functions of bipartite maps on orientable surfaces (Q311545) (← links)
- Triangles in random cubic planar graphs (Q322273) (← links)
- Characterisation of symmetries of unlabelled triangulations (Q322330) (← links)
- Enumeration of cubic multigraphs on orientable surfaces (Q322334) (← links)
- Decompositions of a polygon into centrally symmetric pieces (Q350249) (← links)
- Proof of the lagrangean formalism of hermitean 1-matrix models to all orders (Q359252) (← links)
- Uniqueness and universality of the Brownian map (Q359693) (← links)
- On the enumeration of circular maps with given number of edges (Q376201) (← links)
- Improved enumeration of simple topological graphs (Q377494) (← links)
- A central limit theorem for the number of degree-\(k\) vertices in random maps (Q378231) (← links)
- Counting maps on doughnuts (Q391387) (← links)
- Log-concavity of genus distributions of ring-like families of graphs (Q404443) (← links)
- A note on irreducible maps with several boundaries (Q405102) (← links)
- A simple formula for the series of constellations and quasi-constellations with boundaries (Q405195) (← links)
- Counting 2-connected 4-regular maps on the projective plane (Q405265) (← links)
- Total embedding distributions of Ringel ladders (Q409359) (← links)
- Unified bijections for maps with prescribed degrees and girth (Q423656) (← links)
- Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices (Q442387) (← links)
- A generic method for bijections between blossoming trees and planar maps (Q491530) (← links)
- Spanning forests in regular planar maps (Q491963) (← links)
- Exponential bounds on the number of causal triangulations (Q500033) (← links)
- Counting hypermaps by Egorychev's method (Q505005) (← links)
- A bijection for rooted maps on general surfaces (Q507808) (← links)
- Enumeration of 4-regular one-face maps (Q518188) (← links)
- Counting outerplanar maps (Q528975) (← links)
- Dissecting a square into rectangles of equal area (Q595670) (← links)
- The asymptotic enumeration of rooted convex polyhedra (Q595676) (← links)
- The number of rooted circuit boundary maps (Q606319) (← links)
- Geodesics in large planar maps and in the Brownian map (Q617887) (← links)
- Efficient search of combinatorial maps using signatures (Q630606) (← links)
- A bijection for triangulations, quadrangulations, pentagulations, etc. (Q645974) (← links)
- An analogue of the Harer-Zagier formula for unicellular maps on general surfaces (Q651055) (← links)
- Planar maps and continued fractions (Q663285) (← links)
- Sorting twice through a stack (Q688711) (← links)
- Counting colored random triangulations (Q699557) (← links)
- Census of planar maps: From the one-matrix model solution to a combinatorial proof (Q701544) (← links)
- Enumeration and limit laws of dissections on a cylinder (Q708420) (← links)
- Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth (Q778701) (← links)
- On the number of rooted c-nets (Q793049) (← links)
- Hamiltonian cycles in cubic 3-connected bipartite planar graphs (Q801087) (← links)
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
- Counting unrooted maps on the plane (Q859622) (← links)
- Bisingular maps on the torus (Q874353) (← links)
- Combinatoric enumeration of two-dimensional proper arrays (Q882107) (← links)
- Gray coding cubic planar maps (Q906395) (← links)
- Rooted planar maps modulo some patterns (Q906462) (← links)
