Magda Dettlaff, Michael A. Henning, Jerzy Topp·2022-10-26·via math.CO updates on arXiv.org
A graph is $α$-excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the $α$-excellent $2$-trees.