Linear-size graphs at every strict dismantling level

Jesús F. Espinoza, Martín Eduardo Frías-Armenta, Rosalía G. Hernández-Amador +1

Dismantling reduces a graph to one vertex by successive deletions. At level zero, a vertex is eligible if one of its neighbours is adjacent to all its other neighbours. At level $k…