We discuss the relationship between the vertical connectivity of a biased graph and the Tutte connectivity of the frame matroid of (also known as the bias matroid of ).
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...