Minimal hard classes of graphs for the edge list-ranking problem

We consider the notion of a minimal hard class of graphs for the edge list-ranking problem. We investigate the way of obtaining such classes and reveal a new class of this kind. We show completeness of a set of some classes of graphs as a system of minimal hard classes that can be obtained in the framework of the proposed approach. Bibliogr. 5.