Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
From MaRDI portal
Publication:1378513
zbMath0885.05076MaRDI QIDQ1378513
Publication date: 12 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119255
05C30: Enumeration in graph theory
Related Items
Counting colored random triangulations, Census of planar maps: From the one-matrix model solution to a combinatorial proof, A bijective census of nonseparable planar maps, Geodesic distance in planar graphs, Statistics of planar graphs viewed from a vertex: A study via labeled trees, Enumeration of planar constellations, Enumeration of Eulerian and unicursal planar maps, Rectangular matrix models and combinatorics of colored graphs, Combinatorics of hard particles on planar graphs, A bijection for triangulations of a polygon with interior points and multiple edges, Polynomial equations with one catalytic variable, algebraic series and map enumeration