The negative type inequalities of a metric space are closely tied to embeddability. A result by Gupta, Newman, and Rabinovich implies that if a metric graph $G$ does not contain a theta submetric as an embedding, then $G$ has negative type. We show the converse: if a metric graph $G$ contains a theta, then it does not have negative type.