Subgraph trees in graph theory (Q1406544)
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: Subgraph trees in graph theory |
scientific article; zbMATH DE number 1974981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subgraph trees in graph theory |
scientific article; zbMATH DE number 1974981 |
Statements
Subgraph trees in graph theory (English)
0 references
4 September 2003
0 references
This survey paper discusses in detail the common sort of tree structures determined by selected induced subgraphs. This approach has been useful to study chordal graphs. Generalized clique trees selected, for example, by vertex neighbourhoods made it possible to extend concepts and results from chordal graphs to other graph classes, like---slightly surprisingly---outerplanar graphs. After outlining these concepts, special emphasis to strongly chordal graphs is given.
0 references
clique trees
0 references
subgraph trees
0 references
chordal graphs
0 references
strongly chordal graphs
0 references
outerplanar graphs
0 references
distance-hereditary graphs
0 references
chordal bipartite graphs
0 references
0.7879213094711304
0 references
0.7806016802787781
0 references
0.7461780905723572
0 references
