HIGHLIGHTS
- who: Lagrange formula and collaborators from the 365–, c , Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France have published the research work: A bijection between planar constellations and some colored Lagrangian trees, in the Journal: (JOURNAL)
- what: The authors now focus on unrestricted regular m-Eulerian trees (i.e. balanced and unbalanced trees), and the authors show that the enumeration of balanced trees can be reduced to the enumeration of unrestricted trees (Lemma 3.4). The authors focus on the case f ≥ 2 (for m-cacti, a more efficient algorithm is presented). But if . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.