ON A THEOREM OF MADER

被引:43
作者
FRANK, A
机构
[1] Research Institute for Discrete Mathematics, Institute for Operations Research, University of Bonn, W-5300 Bonn 1
关键词
D O I
10.1016/0012-365X(92)90589-8
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A relatively simple proof is given for (a slight strengthening of) a theorem of W. Mader on the existence of splittable pairs of edges in an undirected graph.
引用
收藏
页码:49 / 57
页数:9
相关论文
共 5 条
[1]  
Ford L., 1962, FLOWS NETWORKS, V71, P1059, DOI 10.2307/2311955
[2]   AUGMENTING GRAPHS TO MEET EDGE-CONNECTIVITY REQUIREMENTS [J].
FRANK, A .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1992, 5 (01) :25-53
[3]  
LOVASZ L, 1974, LECTURE C GRAPH THEO
[4]  
Lovasz L., 1979, COMBINATORIAL PROBLE
[5]  
MADER W, 1978, ANN DISCRETE MATH, V3, P145