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

Zelinka, B.: Strongly connected digraphs in which each edge is contained in exactly two cycles. Acta cybernetica, (4) 2. pp. 203-205. (1979)

[img] Cikk, tanulmány, mű
cybernetica_004_fasc_002_203-205.pdf

Download (539kB)
Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1979
Volume: 4
Number: 2
Page Range: pp. 203-205
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Matematika
Additional Information: Bibliogr.: 205. p.; Ismertetett mű: Sil'no svâznye orgrafy, v kotoryh každaâ duga prinadležit točno dvum ciklam
Date Deposited: 2016. Oct. 15. 12:27
Last Modified: 2016. Oct. 15. 12:27
URI: http://acta.bibl.u-szeged.hu/id/eprint/12278

Actions (login required)

View Item View Item