Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T17:58:56.392Z Has data issue: false hasContentIssue false

Decomposable graphs and hypergraphs

Part of:Graph theory

Published online by Cambridge University Press:  09 April 2009

S. L. Lauritzen
Affiliation:
Institute for Elektronik Systems Aalborg UniversityBadehusvej 13 Aalborg, DK-9000, Denmark
T. P. Speed
Affiliation:
CSIRO Division of Mathematics and Statistics P.O. Box 1965, Canberra City ACT, 2601, Australia
K. Vijayan
Affiliation:
Department of Mathematics University of Western AustraliaNedlands, W.A. 6009, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1984