The robust minimum spanning tree problem: Compact and convex uncertainty

We consider the robust minimum spanning tree problem where edges costs are on a compact and convex subset of RnRn. We give the location of the robust deviation scenarios for a tree and characterizations of strictly strong edges and non-weak edges leading to recognition algorithms.