B. Zelinka, “Strongly connected digraphs in which each edge is contained in exactly two cycles”, Acta Cybern, vol. 4, no. 2, pp. 203-205, Jan. 1979.