An update on non-Hamiltonian $\frac{5}{4}$-tough maximal planar graphs
Combinatorics
2018-10-29 v3
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 [Discrete Math. 147 (1995), 301--305]. In addition, we present two generalizations of a similar result of Tk\'{a}\v{c} who considered -tough maximal planar graphs [Discrete Math. 154 (1996), 321--328]; we remark that one of these generalizations gives a tight upper bound. We fix a problematic argument used in the first paper.
Keywords
Cite
@article{arxiv.1705.09475,
title = {An update on non-Hamiltonian $\frac{5}{4}$-tough maximal planar graphs},
author = {Adam Kabela},
journal= {arXiv preprint arXiv:1705.09475},
year = {2018}
}