Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
type: Item
instance of: scholarly article
title: Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
zbMATH Open document ID: 0838.05043
DOI: 10.1016/0012-365X(94)00177-K
author: Jochen Harant
author: Peter J. Owens
published in: Discrete Mathematics
publication date: 1996-03-24T00:00:00Z
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 858068
zbMATH Keywords: non-hamiltonian graph
zbMATH Keywords: shortness exponent
zbMATH Keywords: maximal planar graphs
zbMATH Keywords: toughness
MaRDI profile type: Publication
cites work: Tough graphs and Hamiltonian circuits.
cites work: An upper bound on the shortness exponent of 1-tough, maximal planar graphs
cites work: Shortness exponents of families of graphs
cites work: A 1-tough nonhamiltonian maximal planar graph
full work available at URL: 0012-365x(94)00177-k
OpenAlex ID: W2033228454
Recommended article: An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
Recommended article: Q4518404
Recommended article: Q4014493
Recommended article: Toughness and Hamiltonicity of a class of planar graphs
Recommended article: Maximum nonhamiltonian tough graphs
Recommended article: Q3826606
Recommended article: Toughness and nonhamiltonicity of polyhedral graphs
Recommended article: Q3983253
Recommended article: Q3470493
Recommended article: On maximal planarization of nonplanar graphs
description: scientific article; zbMATH DE number 858068