Decomposable graphs and hypergraphs

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Decomposable graphs and hypergraphs. / Lauritzen, Steffen L.; SPEED, TP; VIJAYAN, K.

I: Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics, Bind 36, Nr. FEB, 1984, s. 12-29.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Lauritzen, SL, SPEED, TP & VIJAYAN, K 1984, 'Decomposable graphs and hypergraphs', Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics, bind 36, nr. FEB, s. 12-29. https://doi.org/10.1017/S1446788700027300

APA

Lauritzen, S. L., SPEED, TP., & VIJAYAN, K. (1984). Decomposable graphs and hypergraphs. Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics, 36(FEB), 12-29. https://doi.org/10.1017/S1446788700027300

Vancouver

Lauritzen SL, SPEED TP, VIJAYAN K. Decomposable graphs and hypergraphs. Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics. 1984;36(FEB):12-29. https://doi.org/10.1017/S1446788700027300

Author

Lauritzen, Steffen L. ; SPEED, TP ; VIJAYAN, K. / Decomposable graphs and hypergraphs. I: Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics. 1984 ; Bind 36, Nr. FEB. s. 12-29.

Bibtex

@article{f637c77404904953ab1e78f4bdfcb46d,
title = "Decomposable graphs and hypergraphs",
abstract = "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.",
author = "Lauritzen, {Steffen L.} and TP SPEED and K VIJAYAN",
year = "1984",
doi = "10.1017/S1446788700027300",
language = "English",
volume = "36",
pages = "12--29",
journal = "Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics",
issn = "0263-6115",
publisher = "Australian Mathematical Society",
number = "FEB",

}

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