Geodesic
Maximal Graphs with Given Connectivity and Edge-Connectivity
Mathematica slovaca, Tome 25 (1975) no. 2, pp. 99-103
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C30, 05C35, 05C99 
@article{MASLO_1975_25_2_a1,
     author = {Gliviak, Ferdinand},
     title = {Maximal {Graphs} with {Given} {Connectivity} and {Edge-Connectivity}},
     journal = {Mathematica slovaca},
     pages = {99--103},
     year = {1975},
     volume = {25},
     number = {2},
     mrnumber = {0414434},
     zbl = {0321.05122},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1975_25_2_a1/}
}
TY  - JOUR
AU  - Gliviak, Ferdinand
TI  - Maximal Graphs with Given Connectivity and Edge-Connectivity
JO  - Mathematica slovaca
PY  - 1975
SP  - 99
EP  - 103
VL  - 25
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1975_25_2_a1/
LA  - en
ID  - MASLO_1975_25_2_a1
ER  - 
%0 Journal Article
%A Gliviak, Ferdinand
%T Maximal Graphs with Given Connectivity and Edge-Connectivity
%J Mathematica slovaca
%D 1975
%P 99-103
%V 25
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1975_25_2_a1/
%G en
%F MASLO_1975_25_2_a1
Gliviak, Ferdinand. Maximal Graphs with Given Connectivity and Edge-Connectivity. Mathematica slovaca, Tome 25 (1975) no. 2, pp. 99-103. http://geodesic.mathdoc.fr/item/MASLO_1975_25_2_a1/

[1] CHARTRAND G., KAUGARS A., LICK D. R.: Critically n-connected graphs. Proc. Amer. math. Soc. 32, 1972, No. 1, 63-69. | MR | Zbl

[2] HALIN R.: Studies on minimally n-connected graphs. In: Combinatorial Mathematics and its Applications. Proc. Conf. Oxford, 1969. Academic Press 1971, 129-136. | MR

[3] HARARY F.: Graph theory. Addison-Wesley, Reading, 1969. | MR | Zbl

[4] LICK D. R.: Critically and minimally n-connected graphs. In: The Many Facets of Graph Theory. Proc. Conf. Kalamazzo, 1968. Springer, Berlin 1969, 199-205. | MR

[5] TUTTE W. T.: Connectivity in graphs. Univ. Press, Toronto 1967. | MR