The following pages link to Coloring random triangulations (Q1382366):
Displaying 15 items.
- A generalization of the Virasoro algebra to arbitrary dimensions (Q659302) (← links)
- Critical behavior of colored tensor models in the large \(N\) limit (Q659319) (← links)
- Counting colored random triangulations (Q699557) (← links)
- Census of planar maps: From the one-matrix model solution to a combinatorial proof (Q701544) (← links)
- An iterative solution of the three-colour problem on a random lattice (Q1382365) (← links)
- Statistics of planar graphs viewed from a vertex: A study via labeled trees (Q1414558) (← links)
- Folding the square-diagonal lattice. (Q1570487) (← links)
- Hamiltonian cycles on a random three-coordinate lattice (Q1570583) (← links)
- Hamiltonian cycles on random Eulerian triangulations (Q1572060) (← links)
- Fully packed \(O\) \((n=1)\) model on random Eulerian triangulations (Q1572121) (← links)
- Rectangular matrix models and combinatorics of colored graphs (Q1850754) (← links)
- Matrix model combinatorics: applications to folding and coloring. (Q2759645) (← links)
- Folding and coloring problems in mathematics and physics (Q4955879) (← links)
- One-matrix differential reformulation of two-matrix models (Q5044158) (← links)
- Random colorings in manifolds (Q6076188) (← links)
