"Strongly connected digraphs in which each edge is contained in exactly two ..."

Bohdan Zelinka (1979)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-09-16

- view
  - electronic edition @ u-szeged.hu
- export record
  dblp key:
  - journals/actaC/Zelinka80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/actaC/Zelinka80
Bohdan Zelinka:
Strongly connected digraphs in which each edge is contained in exactly two cycles. Acta Cybern. 4(2): 203-205 (1979)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.