Johnson, LeRoy F. Algorithms for enumerating the simple cycles of a digraph. (English) Zbl 0523.68060 Numerical mathematics, Proc. 6th Manitoba Conf., Winnipeg/Can. 1976, Congr. Numerantium 18, 211-229 (1977). MSC: 68R10 05C38 68Q25 68W99 05C20 PDFBibTeX XML
Markosyan, A. G.; Markosyan, S. E. An algorithm for the decomposition of a directed graph into directed forests. (Russian) Zbl 0437.05014 Dokl. Akad. Nauk Arm. SSR 65, 129-131 (1977). MSC: 05C05 05C20 05C75 PDFBibTeX XMLCite \textit{A. G. Markosyan} and \textit{S. E. Markosyan}, Dokl., Akad. Nauk Arm. SSR 65, 129--131 (1977; Zbl 0437.05014)
Jenkyns, T. A. p-systems as intersections of matroids. (English) Zbl 0421.05017 Proc. 8th southeast. Conf. on Combinatorics, graph theory, and computing; Baton Rouge 1977, 415-418 (1977). MSC: 05B35 PDFBibTeX XML
Berman, Kenneth A. Enumeration of labelled balanced 4-valent digraphs. (English) Zbl 0407.05051 Proc. 8th southeast. Conf. on Combinatorics, graph theory, and computing; Baton Rouge 1977, 81-89 (1977). MSC: 05C30 05C20 PDFBibTeX XML