Forskning ved Københavns Universitet - Københavns Universitet

Forside

Decomposable graphs and hypergraphs

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfæ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.
OriginalsprogEngelsk
TidsskriftJournal of the Australian Mathematical Society. Series A. Pure mathematics and statistics
Vol/bind36
Udgave nummerFEB
Sider (fra-til)12-29
Antal sider18
ISSN0263-6115
DOI
StatusUdgivet - 1984
Eksternt udgivetJa

ID: 127878547