MATHEMATICA BOHEMICA, Vol. 136, No. 1, pp. 25-26, 2011

A simple proof of Whitney's Theorem on connectivity in graphs

Kewen Zhao

Kewen Zhao, Department of Mathematics, Qiongzhou University, Sanya, Hainan, 572022, P. R. China, e-mail: kewen.zhao@yahoo.com.cn

Abstract: In 1932 Whitney showed that a graph $G$ with order $n\geq3$ is 2-connected if and only if any two vertices of $G$ are connected by at least two internally-disjoint paths. The above result and its proof have been used in some Graph Theory books, such as in Bondy and Murty's well-known Graph Theory with Applications. In this note we give a much simple proof of Whitney's Theorem.

Keywords: connectivity, graph

Classification (MSC 2000): 05C38, 05C45

Full text available as PDF.

Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.

[Previous Article] [Next Article] [Contents of This Number] [Contents of Mathematica Bohemica]
[Full text of the older issues of Mathematica Bohemica at EMIS]