Geodesic
On the existence of critically n-connected graphs
Mathematica slovaca, Tome 26 (1976) no. 1, pp. 53-56
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C35 
@article{MASLO_1976_26_1_a6,
     author = {Gliviak, Ferdinand},
     title = {On the existence of critically n-connected graphs},
     journal = {Mathematica slovaca},
     pages = {53--56},
     year = {1976},
     volume = {26},
     number = {1},
     mrnumber = {0424600},
     zbl = {0349.05117},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1976_26_1_a6/}
}
TY  - JOUR
AU  - Gliviak, Ferdinand
TI  - On the existence of critically n-connected graphs
JO  - Mathematica slovaca
PY  - 1976
SP  - 53
EP  - 56
VL  - 26
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MASLO_1976_26_1_a6/
LA  - en
ID  - MASLO_1976_26_1_a6
ER  - 
%0 Journal Article
%A Gliviak, Ferdinand
%T On the existence of critically n-connected graphs
%J Mathematica slovaca
%D 1976
%P 53-56
%V 26
%N 1
%U http://geodesic.mathdoc.fr/item/MASLO_1976_26_1_a6/
%G en
%F MASLO_1976_26_1_a6
Gliviak, Ferdinand. On the existence of critically n-connected graphs. Mathematica slovaca, Tome 26 (1976) no. 1, pp. 53-56. http://geodesic.mathdoc.fr/item/MASLO_1976_26_1_a6/

[1] CHARTRAND G., KAUGARS A., LICK D. R.: Critically n-connected graphs. Proc. A.М.S., 32, 1972, 63-68. | MR | Zbl

[2] DIRAC G. A.: Minimally 2-connected graphs. J. Reine Angew. Math., 228, 1967, 204-216. | MR | Zbl

[3] ERDÖS P., KELLY P.: The minimal regular graph containing a givеn graph. Amеr. Math. Monthly, 70, 1963, 1074-1075. | MR

[4] HALIN R.: A theorеm on n-connеctеd graphs. J. Comb. Th., 7, 1969, 150-154. | MR

[5] HALIN R.: Zur Thеoriе dеr n-faсh zusammеnhängеndеn Graphеn. Abh. Math. Sеm. Univ. Hamburg, 33, 1969, 133-164. | MR

[6] HALIN R.: Untеrsuchungеn übеr minimalе n-fach zusammеnhängеndе Graphen. Math. Ann., 182, 1969, 175-188. | MR

[7] HALIN R., JUNG H. A.: Über Minimalstrukturen von Graphen, insbesondеrҽ von n-fach zusammenhängenden Graphen. Math. Ann., 152, 1963, 75-94. | MR

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

[9] HEDETNIEMI S.: Characterizations and constructions of minimally 2-connected graphs and minimally strong digraphs. Proc. Louisiana Conf. on Comb., Graph Theory and Computing, Baton Rouge, 1971, 257-283. | MR | Zbl

[10] LICK D. R.: Minimally n-line connected graphs. J. Reine Angew. Math., 252, 1972, 178-182. | MR | Zbl

[11] MADER W.: Minimalе n-faсh zusimmеnhängende Gгaphеn mit maximalѳг Кantеnzahl. J. Rеinе Angеw. Math., 249, 1971, 201-207.

[12] MADER W.: Existеnz gewisser Konfìgurationen in n-gesättigten Graphen und in Graphen genügend gгoßer Kantendichte. Math. Ann., 194, 1971, 295-312. | MR

[13] MADER W.: Existenz n-fach zusammenhängender Teilgraphen in Graphen gеnügend grosseг Kantendichte. Abh. Math. Sеm. Univ. Hamburg, 37, 1972. 86-97. | MR

[14] MADER W.: Ecken von Innen- und Aussengrad n in minimal n-fach kantеi zusammenhängenden Digraphen. Arch. Math., 25, 1974, 107-112. | MR

[15] PLUMMER M. D.: On minimal blocks. Trans. A.M.S., 134, 1968, 85-94. | MR | Zbl