Supported by the National Natural Science Foundation of China(No.11171134);the Fujian Province Science Foundation(No.2013J01014,2011J01015,2007F3070)
An edge e of a k-connected graph G is said to be a removable edge if G O e is still k-connected, where G O e denotes the graph obtained from G by the following way: deleting e to get G - e, and for any end vertex of ...