  We characterise the following property by six obstructions: given a graphic
matroid $M$ and a set $X$ of its elements, when is $M$ the cycle matroid of a
graph $G$ such that $X$ is a connected edge set in $G$?
