Previous |  Up |  Next

Article

Title: On equality of edge-connectivity and minimum degree of a graph (English)
Author: Plesník, Ján
Author: Znám, Štefan
Language: English
Journal: Archivum Mathematicum
ISSN: 0044-8753 (print)
ISSN: 1212-5059 (online)
Volume: 25
Issue: 1
Year: 1989
Pages: 19-25
.
Category: math
.
MSC: 05C35
MSC: 05C38
MSC: 05C40
idZBL: Zbl 0731.05035
idMR: MR1189195
.
Date available: 2008-06-06T06:19:36Z
Last updated: 2012-05-09
Stable URL: http://hdl.handle.net/10338.dmlcz/107335
.
Reference: [1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs and Digraphs.Prindle, Weber and Schmidt, Boston, 1979. MR 0525578
Reference: [2] B. Bollobás: On graphs with equal edge connectivity and minimum degree.Discrete Math. 28 (1979), 321-323. MR 0548631
Reference: [3] G. Chartrand: A graph-theoretical approach to a communications problem.SIAM J. Appl. Math. 14 (1966), 778-781. MR 0207585
Reference: [4] A. H. Esfahanian: Lower bounds on the connectivities of a graph.J. Graph Theory 9 (1985), 503-511. Zbl 0664.05050, MR 0890241
Reference: [5] D. L. Goldsmith, R. C. Entringer: A sufficient condition for equality of edge-connectivity and minimum degree of a graph.J. Graph Theory 3 (1979), 251-255. Zbl 0417.05040, MR 0542546
Reference: [6] L. Lesniak: Results on the edge-connectivity of graphs.Discrete Math. 8 (1974), 351-354. Zbl 0277.05123, MR 0335333
Reference: [7] J. Plesník: Critical graphs of given diameter.Acta Fac. R. N. Univ. Comen. Math. 30 (1975), 71-93. MR 0398904
Reference: [8] T. Soneoka H. Nakada M. Imase, C. Peyrat: Sufficient conditions for maximally connected dense graphs.preprint. MR 0874923
Reference: [9] L. Volkmann: Bemerkungen zum p-fachen Kantenzusammenhang von Graphen.An. Univ. Bucuresti Mat., to appear. Zbl 0649.05046, MR 0978449
Reference: [10] L. Volkmann: Edge-connectivity in partite graphs.J. Graph Theory, to appear.
.

Files

Files Size Format View
ArchMath_025-1989-1_4.pdf 721.7Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo