2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/59616We present bijections enumerating (k,m)-trees, k-gon trees, edge labelled (2,1)-trees, and other tree-like structures. Our constructions are based on Foata's (1971) bijection for cycle-free functions, which is simplified here.8 pagesCombinatorics05A15text