Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set
HarantJochen, RyjácekZdenek, SchiermeyerIngo · Discrete Mathematics · 2002
The well-known greedy algorithm MIN for finding a maximal independent set in a graph G is based on recursively removing the closed neighborhood of a vertex which has (in the currently existing grap...