Sparse certificates and removable cycles in l-mixed p-connected graphs

A graph G=(V,E) is called l-mixed p-connected if G-S-L is connected for all pairs S,L with S⊆V, L⊆E, and l|S|+|L|