Subgraph trees in graph theory
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.
scientific article; zbMATH DE number 1974981
scientific article