Logarithms of Catalan generating functions: A combinatorial approach

We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of tree graphs. Using explicit bijections, we are able to recover known closed expressions for the coefficients of $\log G_k$ by purely combinatorial means of enumeration. The non-algebraic proof easily generalizes to higher powers $\log^a G_k$, $a\geq 2$.