Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics · 1984 · 100 citations · 20 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComputational GeometryDiscrete MathematicsGraph AlgorithmsGraph TheoryHypergraph TheoryClique StructureCliques
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.
20
Incidence matrices and interval graphs
D. R. Fulkerson, Oliver Gross · Pacific Journal of Mathematics · 1965 · 1.3K citations · Full text
Dominic Welsh · Bulletin of the London Mathematical Society · 1974 · 1.1K citations