Given a connected graph $G$ and a vertex $v$, is it polynomially solvable to find a maximal cardinality set of edges incident to $v$, which deletion (still) leaves vertex $v$ to be connected with all the other vertices in $G$?
Preserving connectivity from a vertex by edges deletion
algorithms;complexity theory;time complexity;graph algorithms