This paper generalizes a theorem of Thomassen on paths in planar graph
s. As a corollary, it is shown that every 4-connected planar graph has
a Hamilton path between any two specified vertices x,y and containing
any specified edge other than xy. (C) 1997 John Wiley & Sons, Inc.