Bounded families for the on-line t-relaxed coloring

We introduce a new generalization of the on-line coloring game. We define the concept of bounded family for on-line t-relaxed colorings. This extends the concept of on-line competitive coloring algorithms to t-relaxed colorings. We characterize the trees T for which the family of T-free graphs is bounded and show that the corresponding bounding function is linear.