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

Authors

  • B. Zelinka

Downloads

Download data is not yet available.

Downloads

Published

1979-01-01

How to Cite

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

Issue

Vol. 4 No. 2 (1979)

Section

Regular articles