  In this article, we introduce the notion of the double competition multigraph
of a digraph. We give characterizations of the double competition multigraphs
of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic
digraphs in terms of edge clique partitions of the multigraphs.
