An update on non-Hamiltonian -tough maximal planar graphs |
| |
Authors: | Adam Kabela |
| |
Affiliation: | Department of Mathematics, Institute for Theoretical Computer Science, and European Centre of Excellence NTIS, University of West Bohemia, Pilsen, Czech Republic |
| |
Abstract: | Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of -tough maximal planar graphs presented by Harant and Owens (1995). In addition, we present two generalizations of a similar result of Tká? who considered -tough maximal planar graphs (Tká?, 1996); we remark that one of these generalizations gives a tight upper bound. We fix a problematic argument used in both mentioned papers. |
| |
Keywords: | Toughness Shortness exponent Maximal planar graphs |
本文献已被 ScienceDirect 等数据库收录! |
|