Decomposable graphs and hypergraphs
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
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.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics |
Vol/bind | 36 |
Udgave nummer | FEB |
Sider (fra-til) | 12-29 |
Antal sider | 18 |
ISSN | 0263-6115 |
DOI | |
Status | Udgivet - 1984 |
Eksternt udgivet | Ja |
ID: 127878547