Geodesic
Digraphs maximal with respect to arc connectivity
Mathematica slovaca, Tome 32 (1982) no. 3, pp. 243-253

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
Classification : 05C20, 05C40 
Horák, Peter. Digraphs maximal with respect to arc connectivity. Mathematica slovaca, Tome 32 (1982) no. 3, pp. 243-253. http://geodesic.mathdoc.fr/item/MASLO_1982_32_3_a3/
@article{MASLO_1982_32_3_a3,
     author = {Hor\'ak, Peter},
     title = {Digraphs maximal with respect to arc connectivity},
     journal = {Mathematica slovaca},
     pages = {243--253},
     year = {1982},
     volume = {32},
     number = {3},
     mrnumber = {670000},
     zbl = {0489.05035},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1982_32_3_a3/}
}
TY  - JOUR
AU  - Horák, Peter
TI  - Digraphs maximal with respect to arc connectivity
JO  - Mathematica slovaca
PY  - 1982
SP  - 243
EP  - 253
VL  - 32
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MASLO_1982_32_3_a3/
LA  - en
ID  - MASLO_1982_32_3_a3
ER  - 
%0 Journal Article
%A Horák, Peter
%T Digraphs maximal with respect to arc connectivity
%J Mathematica slovaca
%D 1982
%P 243-253
%V 32
%N 3
%U http://geodesic.mathdoc.fr/item/MASLO_1982_32_3_a3/
%G en
%F MASLO_1982_32_3_a3

[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 | Zbl

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

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

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

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

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

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

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