Maximum and minimum toughness of graphs of small genus
type: Item
instance of: scholarly article
title: Maximum and minimum toughness of graphs of small genus
zbMATH Open document ID: 0874.05036
DOI: 10.1016/S0012-365X(96)00238-5
author: Wayne Goddard
author: Michael D. Plummer
author: H. C. Swart
published in: Discrete Mathematics
publication date: 1997-06-09T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1018524
zbMATH Keywords: bound
zbMATH Keywords: toughness
zbMATH Keywords: connectivity
zbMATH Keywords: genus
zbMATH Keywords: extremal graphs
zbMATH Keywords: planar graphs
zbMATH Keywords: torus
MaRDI profile type: Publication
cites work: Q3789603
cites work: Recognizing tough graphs is NP-hard
cites work: Q3818315
cites work: Tough graphs and Hamiltonian circuits.
cites work: Toughness and Delaunay triangulations
cites work: An upper bound on the shortness exponent of 1-tough, maximal planar graphs
cites work: On the Toughness of a Graph
cites work: Q5547252
cites work: Toughness and nonhamiltonicity of polyhedral graphs
cites work: Hamiltonian results inK1,3-free graphs
cites work: Uniqueness and faithfulness of embedding of toroidal graphs
cites work: Q5661539
cites work: Das Geschlecht des vollständigen paaren Graphen
cites work: Q4773723
cites work: Connectivity, genus, and the number of components in vertex-deleted subgraphs
full work available at URL: s0012-365x(96)00238-5
OpenAlex ID: W2035440971
description: scientific article; zbMATH DE number 1018524