[1] GELLER D., HARARY F.: Connectivity in digraphs. In: Recent Trends in Graph Theory (Lecture Notes in Mathematics 186), Springer-Verlag, Berlin 1971, 105-115. MR 0278998 | Zbl 0214.23401

[2] HARARY F.: The number of dissimilar supergraphs of a lineaг graph. Pacific J. Math., 7, 1957, 903-911. MR 0087623

[3] HARARY F.: On the numbeг of bicolored graphs. Pacific J. Math., 8, 1958, 743-755. MR 0103834

[4] HARARY, F: Graph Theoгy. Addison-Wesley, Reading, Mass., 1969. MR 0256911

[5] HORÁK P.: Digraphs maximal with respect to connectivity. Math. Slovaca, 29, 1979, 87-90. MR 0561782 | Zbl 0401.05047

[6] KAMEDA T.: Note on Halin's theorem on minimally connected gгaphs. J. Combinatorial Theory Seг. B, 17, 1974, 1-4. MR 0416966

[7] MADER W.: Ecken von Innen- und Aussengгad n in minimal n-fach kantenzusammenhangenden Digraphen. Arch. Math. (Basel), 25, 1974, 107-112. MR 0340087

[8] PÓLYA G.: Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math., 68, 1937, 145-254. Zbl 0017.23202