Edge completion sequences for classes of chordal graphs
Richard M. Odom · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 1995
Given an incomplete graph G = (V, E) of order n and size m and possessing some property P, a P-Completion sequence for G is a sequence e1,,,,,,es of edges, where s = (n2) - m, with the property that if Go = G then (1) Gi is obtaIned from G(i-1) by insertion of exactly one edge and (2) Gi has property P for each 1.