4-connected maximal planar graphs are 4-ordered

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 order a, b, c and d.

• Type: Journal
• Year: 2002
• Where: DM
• Authors: Wayne Goddard
• Keywords: 4-connected Maximal Planar, DM 2002