On the Shortness Exponent of 1-tough, Maximal Planar Graphs

TKÁČ, Michal. On the Shortness Exponent of 1-tough, Maximal Planar Graphs. In Discrete mathematics. - Amsterdam : Elsevier B.V., 1996. ISSN 0012-365X, 1996, vol. 154, no. 1-3, p. 321-328
Ohlasy:
[1] KABELA, Adam. An update on non-Hamiltonian 5/4-tough maximal planar graphs. In DISCRETE MATHEMATICS. 2018, vol. 341, no. 3, pp. 579-587. ISSN 0012-365X., Registrované v: WOS
[1] FUJISAWA, Jun - ZAMFIRESCU, Carol T. Non-hamiltonian 1-tough triangulations with disjoint separating triangles. In DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X, 2020, vol. 284, no., pp. 622-625., Registrované v: WOS, SCOPUS
[1] KABELA, Adam. An update on non-Hamiltonian [Figure presented]-tough maximal planar graphs. In Discrete Mathematics. ISSN 0012365X, 2018-03-01, 341, 3, pp. 579-587., Registrované v: SCOPUS, WOS
[1] XU, Jin - LI, Ze Peng - ZHU, En Qiang. Research progress on the theory of maximal planar graphs. In Jisuanji Xuebao/Chinese Journal of Computers. ISSN 02544164, 2015-01-01, 38, 8, pp. 1680-1704., Registrované v: SCOPUS
[1] BAUER, D - BROERSMA, H - SCHMEICHEL, E. Toughness in graphs A survey. In GRAPHS AND COMBINATORICS. ISSN 0911-0119, 2006, vol. 22, no. 1, pp. 1-35., Registrované v: WOS, SCOPUS
[1] GERLACH, T. Toughness and Hamiltonicity of a class of planar graphs. In Discrete Mathematics. ISSN 0012365X, 2004-09-06, 286, 1-2, pp. 61-65., Registrované v: SCOPUS, WOS
[1] BAUER, Doug - BROERSMA, Hajo - SCHMEICHEL, Edward. More Progress on Tough Graphs The Y2K Report. In Electronic Notes in Discrete Mathematics. ISSN 15710653, 2002-07-01, 11, pp. 63-80., Registrované v: SCOPUS
[1] OWENS, PJ. Shortness parameters for polyhedral graphs. In DISCRETE MATHEMATICS. ISSN 0012-365X, 1999, vol. 206, no. 1-3, pp. 159-169., Registrované v: WOS, SCOPUS
[1] BOHME, T - HARANT, J - TKAC, M. More than one tough chordal planar graphs are Hamiltonian. In JOURNAL OF GRAPH THEORY. ISSN 0364-9024, 1999, vol. 32, no. 4, pp. 405-410., Registrované v: WOS, SCOPUS
SHAN, Songling. A Construction of a 3/2-Tough Plane Triangulation With No 2-Factor. In Journal of Graph Theory, 2025-05-01, 109, 1, pp. 5-18. ISSN 03649024. Dostupné na: https://doi.org/10.1002/jgt.23209., Registrované v: SCOPUS, WOS