Discrete MathematicsVolume 30, Issue 3, 1980, Pages 305-307CommunicationA 1-tough nonhamiltonian maximal planar graphAuthor links open overlay panelTakao NishizekiShow moreShareCitehttps://doi.org/10.1016/0012-365X(80)90240-XGet rights and contentUnder an Elsevier user licenseopen archiveAbstractWe construct a maxima' planar graph which is 1-tough but nonhamiltonian. The graph is an answer to Chvátal's question on the existence of such a graph.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1980 Published by Elsevier B.V.