Clique tree generalization and new subclasses of chordal graphs (Q1348383)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Clique tree generalization and new subclasses of chordal graphs |
scientific article; zbMATH DE number 1742052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique tree generalization and new subclasses of chordal graphs |
scientific article; zbMATH DE number 1742052 |
Statements
Clique tree generalization and new subclasses of chordal graphs (English)
0 references
15 May 2002
0 references
The aim of this paper is to obtain a unique structure that reflects the interactions between the maximal cliques of a chordal graph. The authors introduce the notion of a reduced clique hypergraph of a chordal graph which generalizes the notion of a clique tree. A structure theorem which characterizes the hyperedges of the reduced clique hypergraph in terms of the minimal vertex separators is proved. Also the authors derive a formula for counting the number of clique trees of a chordal graph, and they introduce a few new subclasses of chordal graphs.
0 references
maximal cliques
0 references
chordal graph
0 references
reduced clique hypergraph
0 references
clique trees
0 references
minimal vertex separators
0 references
0.8111284971237183
0 references
0.7770253419876099
0 references
0.7749695181846619
0 references
0.7741159200668335
0 references
