Chordal completions of planar graphs

Abstract

We prove that every planar graph on n vertices is contained in a chordal graph with at most cn log n edges for some abolsute constant c and this is best possible to within a constant factor. © 1994 by Academic Press, Inc.