Strong clique trees,neighborhood trees,and strongly chordal graphs |
| |
Authors: | Terry A. McKee |
| |
Abstract: | Maximal complete subgraphs and clique trees are basic to both the theory and applications of chordal graphs. A simple notion of strong clique tree extends this structure to strongly chordal graphs. Replacing maximal complete subgraphs with open or closed vertex neighborhoods discloses new relationships between chordal and strongly chordal graphs and the previously studied families of chordal bipartite graphs, clique graphs of chordal graphs (dually chordal graphs), and incidence graphs of biacyclic hypergraphs. © 2000 John Wiley & Sons, Inc. J. Graph Theory 33: 151–160, 2000 |
| |
Keywords: | clique trees neighborhood trees strongly chordal graphs chordal bipartite graphs |
|
|