= Chordal completion
{wiki=Chordal_completion}
Chordal completion, also known as chordal graph completion, refers to the process of transforming a given graph into a chordal graph. A chordal graph (or "perfect graph") is defined as a graph in which every cycle of four or more vertices has a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle. The process of chordal completion involves adding edges to the original graph in such a way that the resulting graph becomes chordal.
Back to article page