Injectively k -Colored Rooted Forests
DOI
10.1007/s00373-023-02700-5
Document Type
Journal Article
Publication Date
10-1-2023
Publication Title
Graphs and Combinatorics
Volume
39
Issue
5
ISSN
9110119
Keywords
Catalan numbers, Enumerative combinatorics, Forests, Graph colorings, Trees
Abstract
We enumerate injectively k -colored rooted forests with a given number of vertices of each color and a given sequence of root colors. We obtain from this result some new multi-parameter distributions of Fuss–Catalan numbers. As an additional application we enumerate triangulations of regular convex polygons according to their proper 3-coloring type.
Open Access
Green Accepted
Preprint
Repository Citation
Einolf, T., Muth, R., & Wilkinson, J. (2023). Injectively k -Colored Rooted Forests. Graphs and Combinatorics, 39 (5). https://doi.org/10.1007/s00373-023-02700-5
COinS