Geodesic
The extremal connectivity of the strictly weak digraph
Mathematica slovaca, Tome 26 (1976) no. 2, pp. 115-118
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C20, 05C35 
@article{MASLO_1976_26_2_a5,
     author = {Mikola, Milan},
     title = {The extremal connectivity of the strictly weak digraph},
     journal = {Mathematica slovaca},
     pages = {115--118},
     year = {1976},
     volume = {26},
     number = {2},
     mrnumber = {0424605},
     zbl = {0323.05114},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1976_26_2_a5/}
}
TY  - JOUR
AU  - Mikola, Milan
TI  - The extremal connectivity of the strictly weak digraph
JO  - Mathematica slovaca
PY  - 1976
SP  - 115
EP  - 118
VL  - 26
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1976_26_2_a5/
LA  - en
ID  - MASLO_1976_26_2_a5
ER  - 
%0 Journal Article
%A Mikola, Milan
%T The extremal connectivity of the strictly weak digraph
%J Mathematica slovaca
%D 1976
%P 115-118
%V 26
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1976_26_2_a5/
%G en
%F MASLO_1976_26_2_a5
Mikola, Milan. The extremal connectivity of the strictly weak digraph. Mathematica slovaca, Tome 26 (1976) no. 2, pp. 115-118. http://geodesic.mathdoc.fr/item/MASLO_1976_26_2_a5/

[1] HARARY F.: Graph Theory. Reading, Massachusetts, 1969. | MR | Zbl

[2] HARARY F.: The maximum connectivity of a graph. Proc. Nat. Acad. Sci. 1. 1969 1142-1146. | MR

[3] MIKOLA M.: The maximum and minimum connectivity of a digraph. In.: Prác a štúdie VŠD 1, 1974, 13-19. | MR

[4] CARTWRIGHT D., HARARY F.: The number of lines in a graph of each connectedness category. SIAM Rew. 3, 1961, 309-314. | MR