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 University Press

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

[1] 1. Berge, C., Graphs and Hypergraphs, North-Holland, Amsterdam, 1973. Google Scholar

[2] 2. Cockayne, E. J., Hedetniemi, S. T. and Slater, P. J., Matchings and Transversals in Hypergraphs, Domination and Independence in Trees, to appear in JCT(B). Google Scholar

[3] 3. Dirac, G. A., On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25, 71-76 (1961). Google Scholar

[4] 4. Gavril, F., The Intersection Graphs of Subtrees in Trees Are Exactly the Chordal Graphs, JCT(B) 16, 47-56(1974). Google Scholar

[5] 5. Rose, D. J., Triangulated Graphs and the Elimination Process, J. Math. Anal. Appl. 32, 597-609(1970). Google Scholar

Cité par Sources :