Bijective census and random generation ofEulerian planar maps with prescribed

@inproceedings{vertexdegreesGilles1997BijectiveCA,
  title={Bijective census and random generation ofEulerian planar maps with prescribed},
  author={vertexdegreesGilles and Schae and erLIX},
  year={1997}
}
  • vertexdegreesGilles, Schae, erLIX
  • Published 1997
We give a bijection between Eulerian planar maps with prescribed vertex degrees, and some plane trees that we call balanced Eulerian trees. To enumerate the latter, we introduce conjugation classes of planted plane trees. In particular the result answers a question of Bender and Canneld in BC94] and allows uniform random generation of Eulerian planar maps with restricted vertex degrees. Using a well known correspondence between 4-regular planar maps with n vertices and planar maps with n edges… CONTINUE READING