论文部分内容阅读
An edge e of a k-connected graph G is said to be a removable edge if G e is still k-connected,where G e denotes the graph obtained from G by deleting e to get G θ e,and for any end vertex of e with degree k - 1 in G θ e,say x,delete x,and then add edges b