Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A bijection between ...
Article

A bijection between planar constellations and some colored Lagrangian trees

Cedric Chauve ORCID (1)
(1) Laboratoire de combinatoire et d'informatique mathématique [Montréal]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2003
Last modified on
March 31, 2025
Volume 6
vol. 6:1
DOI
10.46298/dmtcs.340
License
https://about.hal.science/hal-authorisation-v1
Indicators
569
Views
777
Downloads

A bijection between planar constellations and some colored Lagrangian trees

Cedric Chauve ORCID (1)
(1) Laboratoire de combinatoire et d'informatique mathématique [Montréal]
Abstract
Constellations are colored planar maps that generalize different families of maps (planar maps, bipartite planar maps, bi-Eulerian planar maps, planar cacti, ...) and are strongly related to factorizations of permutations. They were recently studied by Bousquet-Mélou and Schaeffer who describe a correspondence between these maps and a family of trees, called Eulerian trees. In this paper, we derive from their result a relationship between planar constellations and another family of trees, called stellar trees. This correspondence generalizes a well known result for planar cacti, and shows that planar constellations are colored Lagrangian objects (that is objects that can be enumerated by the Good-Lagrange formula). We then deduce from this result a new formula for the number of planar constellations having a given face distribution, different from the formula one can derive from the results of Bousquet-Mélou and Schaeffer, along with systems of functional equations for the generating functions of bipartite and bi-Eulerian planar maps enumerated according to the partition of faces and vertices.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Planar maps
  • trees
  • enumeration
  • bijection
  • Lagrange formula
Preview
Loading PDF preview...