Meshes on 3-connected graphs

It is shown that in a finite 3-connected graph every pair of edges can be linked by a sequence of non-separating diagonal-free circuits C₀,…, C_n such that C_i-1 and C_i have an edge in common. Examples are given to illustrate the extent to which this theorem breaks down when the hypothesis of finiteness is removed.