Abstract
A graph is chordal if every cycle of length at least 4 has a chord, an edge between two non-consecutive vertices of the cycle. After reviewing some of the fundamental properties and characterizations of chordal graphs, we present significant developments obtained over recent years, both algorithmic and graph-theoretic. Chordal graphs form one of the earliest families for which structural properties fundamentally help in solving many NP-hard problems efficiently. They also lead to the development of the notion of tree-width and partial k-trees. Chordal graphs appear in numerous applications in algorithmic graph theory, computer science and optimization.
| 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 | 130-151 |
| Number of pages | 22 |
| 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
Fingerprint
Dive into the research topics of 'Chordal graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver