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.
Recommendations
Cites work
- Characterizations of competition multigraphs
- Competition hypergraphs
- Competition hypergraphs of digraphs with certain properties I. Strong connectedness
- Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
- Competition hypergraphs of products of digraphs
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- On CCE graphs of doubly partial orders
- On the hypercompetition numbers of hypergraphs.
- The competition-common enemy graph of a digraph
- The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$
- Topics in Intersection Graph Theory
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
Cited in
(8)- The double competition multigraph of a digraph
- The Double Multicompetition Number of a Multigraph
- scientific article; zbMATH DE number 1154594 (Why is no real title available?)
- Niche hypergraphs
- Niche hypergraphs of products of digraphs
- Competition hypergraphs of products of digraphs
- On the hypercompetition numbers of hypergraphs.
- Competition hypergraphs
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)