A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three
generalizations of the concept of simplicial vertices: avoidable vertices (also known as OCF …