Chordal Completions of Planar Graphs


A graph is said to be chordal if every cycle with at least four vertices always contains a chord. (A chordal graph is sometimes called a triangulated graph in the literature. For graph-theoretical terminology, the reader is referred to [4].) A chordal completion of a graph G is a chordal graph with the same vertex set as G which contains all edges of G. The… (More)


  • Presentations referencing similar topics