Edge Annihilation Sequences for Classes of Chordal Graphs.
Thomas. Carroll · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 1996
Given a non-empty graph G=(VE) of order n and size m, with some property P, we may ask whether there exists a sequence of graphs constructed by the sequential removal of edges e1, e2,...,em, with the property that if Go=G then (1) Gi is obtained from G(i-1) by deletion of exactly one edge and (2) Gi has property P for 1.