@article{MASLO_1982_32_1_a8,
author = {Hor\'ak, Peter},
title = {Enumeration of graphs maximal with respect to connectivity},
journal = {Mathematica slovaca},
pages = {81--84},
year = {1982},
volume = {32},
number = {1},
mrnumber = {648224},
zbl = {0492.05039},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1982_32_1_a8/}
}
Horák, Peter. Enumeration of graphs maximal with respect to connectivity. Mathematica slovaca, Tome 32 (1982) no. 1, pp. 81-84. http://geodesic.mathdoc.fr/item/MASLO_1982_32_1_a8/
[1] CHATY G., CHEIN M.: Minimally 2-edge connected graphs. J. Graph Theory, 3, 1979, 15-22. | MR | Zbl
[2] DIRAC G. A.: Minimally 2-connected gгaphs. J. Reine Angew. Math., 197, 1967, 204-216. | MR
[3] GLIVIAK F.: Maximal graphs with given connectivity and edge connectivity. Mat. Čas., 25, 1975, 99-103. | MR | Zbl
[4] HARARY F.: Graph Theory. Addison-Wesley, Reading, Mass. 1969. | MR | Zbl
[5] HARARY F.: The number of dissimilar supergraphs. Pacific J. Math., 7, 1957, 903-911. | MR | Zbl
[6] HARARY F.: On the number of bicolored graphs. Pacific J. Math., 8, 1958, 743-755. | MR
[7] PLUMMER M. D.: On minimal blocks. Trans. Amer. Math. Soc., 134, 1968, 85-94. | MR | Zbl
[8] SLATER P. J.: A classification of 4-connected graphs. J. Combinatorial Theory Ser. B, 17, 1974, 281-298. | MR | Zbl
[9] TUTTE W. T.: A theory of 3-connected graphs. Indag. Math., 23, 1961, 441-455. | MR | Zbl