Obstructions to Total Rainbow Forests in Edge-Colored Graphs

A total rainbow forest in an edge-colored graph is a forest that contains every edge color exactly once. Using a necessary and sufficient condition that a total rainbow forest exists, we demonstrate the existence of huge numbers of edge-colored graphs that are minimal obstructions to such existence.