---
tag: KX4MJ8489H
kind: concept
name: Chordal completion
sources:
  - wikipedia: en:48088710@r1369270789
    locator: Chordal completion
    note: adopted
    mention: wikipedia://en/48088710
    sections: [Summary]
same_as:
  wikidata: Q25304222
  wikipedia: Chordal completion
inventory: [FTQAG0SK6W]
---

## Summary

In graph theory, a branch of mathematics, a **chordal completion** of a given undirected graph $G$ is a chordal graph, on the same vertex set, that has $G$ as a subgraph. A **minimal chordal completion** is a chordal completion such that any graph formed by removing an edge would no longer be a chordal completion. A **minimum chordal completion** is a chordal completion with as few edges as possible.