A graph G is strongly asteroidal if it contains three vertices a, b, c such that there is a path between any two of these vertices that
- Does not contain the third vertex, nor any neighbor of the third vertex.
- Does not contain two consecutive vertices that are adjacent to every neighbor of the third vertex.
This? Is my job.