Constrained edge-splitting problems ∗

  • Tibor Jord
  • Published 1999
Splitting off two edgessu, sv in a graphG means deletingsu, sv and adding a new edgeuv. Let G = (V + s,E) be k-edge-connected inV (k ≥ 2) and letd(s) be even. Lov ́ asz proved that the edges incident to s can be split off in pairs in a such a way that the resulting graph on vertex set V is k-edge-connected. In this paper we investigate the existence of such… CONTINUE READING