We present several bijections, in terms of combinatorial objects counted by the Schröder numbers, that are then used (via coloring of Dyck paths) for the construction and enumeration of rational Schröder paths with integer slope, ordered rooted trees, and simple rooted outerplanar maps. On the other hand, we derive partial Bell polynomial identities for the little and large Schröder numbers, which allow us to obtain explicit enumeration formulas.