Efficient Recognition and Analysis of Thick Forests, a Class of Perfect Graphs

Thick forests are a class of perfect graphs that can be recognized in polynomial time, unlike most other classes of thick graphs. The author develops efficient algorithms for recognizing thick forests and analyzing their properties, such as counting independent sets and colorings.