Successive vertex orderings of fully regular graphs

Lixing Fang, Hao Huang, Janos Pach +2

A graph G = (V,E) is called fully regular if for every independent set $I\subset V$ , the number of vertices in $V\setminus$ I that are not connected to any element of I depends on…