Counting colored random triangulations
From MaRDI portal
Publication:699557
DOI10.1016/S0550-3213(02)00582-5zbMath0998.05019arXivcond-mat/0206452MaRDI QIDQ699557
Philippe Di Francesco, Emmanuel Guitter, Jérémie Bouttier
Publication date: 24 September 2002
Published in: Nuclear Physics. B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0206452
05C30: Enumeration in graph theory
82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
05C15: Coloring of graphs and hypergraphs
Related Items
A generalization of the Virasoro algebra to arbitrary dimensions, Critical behavior of colored tensor models in the large \(N\) limit, Census of planar maps: From the one-matrix model solution to a combinatorial proof, Geodesic distance in planar graphs, Statistics of planar graphs viewed from a vertex: A study via labeled trees, Rectangular matrix models and combinatorics of colored graphs, Geodesic distance in planar graphs: an integrable approach
Cites Work