Niche Hypergraphs
Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 4, pp. 819-832

Voir la notice de l'article provenant de la source Library of Science

If D = (V,A) is a digraph, its niche hypergraph Nℋ(D) = (V, ℰ) has the edge set ℰ = ℯ ⊆ V | |e| ≥ 2 ∧ ∃ v ∈ V : e = ND-(v) ∨ ℯ = ND+(v). Niche hypergraphs generalize the well-known niche graphs (see [11]) and are closely related to competition hypergraphs (see [40]) as well as double competition hypergraphs (see [33]). We present several properties of niche hypergraphs of acyclic digraphs.
Keywords: niche hypergraph, niche number
@article{DMGT_2016_36_4_a3,
     author = {Garske, Christian and Sonntag, Martin and Teichert, Hanns-Martin},
     title = {Niche {Hypergraphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {819--832},
     publisher = {mathdoc},
     volume = {36},
     number = {4},
     year = {2016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a3/}
}
TY  - JOUR
AU  - Garske, Christian
AU  - Sonntag, Martin
AU  - Teichert, Hanns-Martin
TI  - Niche Hypergraphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2016
SP  - 819
EP  - 832
VL  - 36
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a3/
LA  - en
ID  - DMGT_2016_36_4_a3
ER  - 
%0 Journal Article
%A Garske, Christian
%A Sonntag, Martin
%A Teichert, Hanns-Martin
%T Niche Hypergraphs
%J Discussiones Mathematicae. Graph Theory
%D 2016
%P 819-832
%V 36
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a3/
%G en
%F DMGT_2016_36_4_a3
Garske, Christian; Sonntag, Martin; Teichert, Hanns-Martin. Niche Hypergraphs. Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 4, pp. 819-832. http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a3/