Note on Halin's theorem on minimally connected graphs
暂无分享,去创建一个
Abstract In this note it is shown that any finite directed graph of strong connectivity n contains either a vertex with indegree n, a vertex with outdegree n, or an edge whose removal does not decrease the connectivity. This is a directed graph counterpart of Halin's theorem on undirected graphs. It is pointed out that only a few preparations and modifications are necessary to make his proof valid for directed graphs.
[1] G. Dirac. SHORT PROOF OF MENGER'S GRAPH THEOREM , 1966 .
[2] K. Menger. Zur allgemeinen Kurventheorie , 1927 .
[3] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .
[4] R. Halin. A theorem on n-connected graphs , 1969 .