Strongly connected digraphs in which each edge is contained in exactly two cycles

Zelinka, B. (1979). Strongly connected digraphs in which each edge is contained in exactly two cycles. Acta Cybernetica, 4(2), 203-205. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3178