A bijection for triangulations of a polygon with interior points and multiple edges
From MaRDI portal
Publication:1885024
DOI10.1016/S0304-3975(03)00226-3zbMath1048.05046MaRDI QIDQ1885024
Gilles Schaeffer, Dominique Poulalhon
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (9)
Bijective counting of Kreweras walks and loopless triangulations ⋮ Percolation on Triangulations: A Bijective Path to Liouville Quantum Gravity ⋮ Unified bijections for maps with prescribed degrees and girth ⋮ Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments ⋮ A generic method for bijections between blossoming trees and planar maps ⋮ Enumeration and limit laws of dissections on a cylinder ⋮ Uniform random sampling of planar graphs in linear time ⋮ Bijections for planar maps with boundaries ⋮ Combinatorics of hard particles on planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Census of planar maps: From the one-matrix model solution to a combinatorial proof
- A bijective census of nonseparable planar maps
- Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
- Left ternary trees and non-separable rooted planar maps
- Enumeration of planar constellations
- Combinatorics of hard particles on planar graphs
- A Census of Planar Triangulations
- A Census of Slicings
- On Counting Rooted Triangular Maps
- A Census of Planar Maps
This page was built for publication: A bijection for triangulations of a polygon with interior points and multiple edges
