The authors present a framework for studying computational complexity of graph problems on monotone classes, providing insights into hard versus easy problems within the framework.
