Previous |  Up |  Next

Article

Title: Maximal Graphs with Given Connectivity and Edge-Connectivity (English)
Author: Gliviak, Ferdinand
Language: English
Journal: Matematický časopis
ISSN: 0025-5173
Volume: 25
Issue: 2
Year: 1975
Pages: 99-103
.
Category: math
.
MSC: 05C30
MSC: 05C35
MSC: 05C99
idZBL: Zbl 0321.05122
idMR: MR0414434
.
Date available: 2009-09-25T08:35:05Z
Last updated: 2012-07-31
Stable URL: http://hdl.handle.net/10338.dmlcz/126956
.
Reference: [1] CHARTRAND G., KAUGARS A., LICK D. R.: Critically n-connected graphs.Proc. Amer. math. Soc. 32, 1972, No. 1, 63-69. Zbl 0228.05118, MR 0290999
Reference: [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 0278980
Reference: [3] HARARY F.: Graph theory.Addison-Wesley, Reading, 1969. Zbl 0196.27202, MR 0256911
Reference: [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 0256916
Reference: [5] TUTTE W. T.: Connectivity in graphs.Univ. Press, Toronto 1967. MR 0210617
.

Files

Files Size Format View
MathSlov_25-1975-2_2.pdf 410.3Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo