The double competition hypergraph of a digraph

From MaRDI portal




Abstract: 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.









This page was built for publication: The double competition hypergraph of a digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496443)