On d-ary trees with restricted colorings

In a recent work by Hong and Park, rooted plane d-ary trees with colored inner vertices were considered.Every inner vertex was colored with either a ”good” or a ”bad” color, with the catch that the leftmost childof a vertex colored with a ”bad” color must not also be colored with a ”bad” color. In this talk, we walkthrough a thorough analysis of this combinatorial class and obtain both exact as well as asymptotic results.