Geodesic
A Characterization of Soft Hypergraphs
Canadian mathematical bulletin, Tome 21 (1978) no. 3, pp. 335-337

Voir la notice de l'article provenant de la source Cambridge

DOI

A hypergraph is a subtree of a tree (SOFT) hypergraph if there exists a tree T such that X=V(T) and for each there is a subtree Ti of T such that Ei = V(Ti). It is shown that H is a SOFT hypergraph if and only if has the Helly property and , the intersection graph of is chordal. Results of Berge and Gavril have previously shown these to be necessary conditions.
DOI : 10.4153/CMB-1978-058-5
Mots-clés : chordal graph, Helly property, hypergraph, Menger system, tree., 05005 
Slater, Peter J. A Characterization of Soft Hypergraphs. Canadian mathematical bulletin, Tome 21 (1978) no. 3, pp. 335-337. doi: 10.4153/CMB-1978-058-5
@article{10_4153_CMB_1978_058_5,
     author = {Slater, Peter J.},
     title = {A {Characterization} of {Soft} {Hypergraphs}},
     journal = {Canadian mathematical bulletin},
     pages = {335--337},
     year = {1978},
     volume = {21},
     number = {3},
     doi = {10.4153/CMB-1978-058-5},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-058-5/}
}
TY  - JOUR
AU  - Slater, Peter J.
TI  - A Characterization of Soft Hypergraphs
JO  - Canadian mathematical bulletin
PY  - 1978
SP  - 335
EP  - 337
VL  - 21
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-058-5/
DO  - 10.4153/CMB-1978-058-5
ID  - 10_4153_CMB_1978_058_5
ER  - 
%0 Journal Article
%A Slater, Peter J.
%T A Characterization of Soft Hypergraphs
%J Canadian mathematical bulletin
%D 1978
%P 335-337
%V 21
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-058-5/
%R 10.4153/CMB-1978-058-5
%F 10_4153_CMB_1978_058_5

Cité par Sources :