Decomposable graphs and hypergraphs
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Decomposable graphs and hypergraphs. / Lauritzen, Steffen L.; SPEED, TP; VIJAYAN, K.
In: Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics, Vol. 36, No. FEB, 1984, p. 12-29.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Decomposable graphs and hypergraphs
AU - Lauritzen, Steffen L.
AU - SPEED, TP
AU - VIJAYAN, K
PY - 1984
Y1 - 1984
N2 - We define and investigate the notion of a decomposable hypergraph, showing that such a hypergraph always is conformal, that is, can be viewed as the class of maximal cliques of a graph. We further show that the clique hypergraph of a graph is decomposable if and only if the graph is triangulated and characterise such graphs in terms of a combinatorial identity.
AB - We define and investigate the notion of a decomposable hypergraph, showing that such a hypergraph always is conformal, that is, can be viewed as the class of maximal cliques of a graph. We further show that the clique hypergraph of a graph is decomposable if and only if the graph is triangulated and characterise such graphs in terms of a combinatorial identity.
U2 - 10.1017/S1446788700027300
DO - 10.1017/S1446788700027300
M3 - Journal article
VL - 36
SP - 12
EP - 29
JO - Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics
JF - Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics
SN - 0263-6115
IS - FEB
ER -
ID: 127878547