The variety of triangular embeddings of a graph in the projective plane

Abstract In general, a graph admits τ ≥ 1 essentially different triangular embeddings in the projective plane. The set of these τ triangulations splits up into isomorphism classes. We determine the spectrum of possible values of τ and all possible partitions of τ into the cardinalities of such classes.