Abstract. The problem of characterizing essentially cyclic digraphs is difficult and yet unsolved. In the present paper, this problem is solved with respect to the class of digraphs with ring structure. By such a digraph we mean a digraph that contains a Hamiltonian cycle and whose remaining arcs belong to the inverse Hamiltonian cycle. We also consider the problem of essential cyclicity for weighted digraphs.