2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/120082There are several combinatorial objects that are known to be in bijection to the spanning trees of a graph G. These objects include G-parking functions, critical configurations of G, and descending traversals of G. In this paper, we extend the bijections to generalizations of all three objects.13 pages, 3 figuresCombinatorics05C30, 05C05 (primary)text