On Almost Well-Covered Graphs of Girth at Least 6

Tınaz Ekim, Didem Gözüpek, Ademir Hujdurović +1

We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-co…