  We study triangle decompositions of graphs. We consider constructions of
classes of graphs where every edge lies on a triangle and the addition of the
minimum number of multiple edges between already adjacent vertices results in a
strongly triangle divisible graph that is also triangle decomposable. We
explore several classes of planar graphs as well as a class of toroidal graphs.
