A SIMPLE PROOF OF WHITNEY'S THEOREM ON CONNECTIVITY IN GRAPHS

被引:0
|
作者
Zhao, Kewen [1 ]
机构
[1] Moorhead State Univ, Dept Comp Sci & Informat Syst, Moorhead, MN 56563 USA
来源
MATHEMATICA BOHEMICA | 2011年 / 136卷 / 01期
关键词
connectivity; graph;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In 1932 Whitney showed that a graph G with order n >= 3 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.
引用
收藏
页码:25 / 37
页数:14
相关论文
共 50 条