On the Minimum Chordal Completion Polytope

David Bergman, Carlos H. Cardonha, Andre A. Cire +1

A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in…