A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
It is shown that the shortness exponent of the class of l-tough, maximal planar graphs is at most log, 5. The non-Hamiltonian, l-tough, maximal planar graph with a minimum number of vertices is presented. 0012-365X/96/$15.00 0 1996-Elsevier Science B.V. All rights reserved SSDI 0012-365X(94)00356-4doi:10.1016/0012-365x(94)00356-n fatcat:j6heulytrrbbxmu26qbbldm4wa