  We study compositions whose parts are colored by subsequences of the
Fibonacci numbers. We give explicit bijections between Fibonacci colored
compositions and several combinatorial objects, including certain restricted
ternary and quaternary words, spanning trees in the ladder graph, unimodal
sequences covering an initial interval, and ordered-consecutive partition
sequences. Our approach relies on the basic idea of representing the colored
compositions as tilings of an $n$-board whose tiles are connected, and
sometimes decorated, according to a suitable combinatorial interpretation of
the given coloring sequence.
