The edge fault-diameter of Cartesian graph bundles

A Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph product. Let GG be a kGkG-edge connected graph and D̄c(G) be the largest diameter of subgraphs of GG obtained by deleting c