Previous |  Up |  Next

Article

Title: Enumeration of graphs maximal with respect to connectivity (English)
Author: Horák, Peter
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 32
Issue: 1
Year: 1982
Pages: 81-84
.
Category: math
.
MSC: 05C30
MSC: 05C40
idZBL: Zbl 0492.05039
idMR: MR648224
.
Date available: 2009-09-25T09:18:35Z
Last updated: 2012-07-31
Stable URL: http://hdl.handle.net/10338.dmlcz/136286
.
Reference: [1] CHATY G., CHEIN M.: Minimally 2-edge connected graphs.J. Graph Theory, 3, 1979, 15-22. Zbl 0394.05030, MR 0519170
Reference: [2] DIRAC G. A.: Minimally 2-connected gгaphs.J. Reine Angew. Math., 197, 1967, 204-216. MR 0216975
Reference: [3] GLIVIAK F.: Maximal graphs with given connectivity and edge connectivity.Mat. Čas., 25, 1975, 99-103. Zbl 0321.05122, MR 0414434
Reference: [4] HARARY F.: Graph Theory.Addison-Wesley, Reading, Mass. 1969. Zbl 0196.27202, MR 0256911
Reference: [5] HARARY F.: The number of dissimilar supergraphs.Pacific J. Math., 7, 1957, 903-911. Zbl 0078.16505, MR 0087623
Reference: [6] HARARY F.: On the number of bicolored graphs.Pacific J. Math., 8, 1958, 743-755. MR 0103834
Reference: [7] PLUMMER M. D.: On minimal blocks.Trans. Amer. Math. Soc., 134, 1968, 85-94. Zbl 0187.21101, MR 0228369
Reference: [8] SLATER P. J.: A classification of 4-connected graphs.J. Combinatorial Theory Ser. B, 17, 1974, 281-298. Zbl 0298.05136, MR 0373943
Reference: [9] TUTTE W. T.: A theory of 3-connected graphs.Indag. Math., 23, 1961, 441-455. Zbl 0101.40903, MR 0140094
.

Files

Files Size Format View
MathSlov_32-1982-1_9.pdf 365.9Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo