DM
2002
13 years 10 months ago
2002
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...