Abstract
This chapter presents dually chordal graphs, which are the dual variant of chordal graphs (in a hypergraph sense), and their well-known common hereditary subclass, the strongly chordal graphs. Like chordal graphs, these classes also have a fundamental tree representation underpinning their structure, as well as various algorithmic applications and alternative hypergraph characterizations. We conclude by discussing the class of graphs that are weakly chordal and bipartite, known as chordal bipartite graphs, and whose structure is closely related to strongly chordal graphs.
| Original language | English |
|---|---|
| Title of host publication | Encyclopedia of Mathematics and its Applications |
| Subtitle of host publication | Topics in Algorithmic Graph Theory |
| Publisher | Cambridge University Press |
| Pages | 152-167 |
| Number of pages | 16 |
| ISBN (Electronic) | 9781108592376 |
| ISBN (Print) | 9781108492607 |
| DOIs | |
| State | Published - 3 Jun 2021 |
Bibliographical note
Publisher Copyright:© Cambridge University Press 2021. All rights reserved.
ASJC Scopus subject areas
- General Mathematics
- General Computer Science