The toughness of split graphs
type: Item
instance of: scholarly article
title: The toughness of split graphs
zbMATH Open document ID: 0955.05103
DOI: 10.1016/S0012-365X(98)00156-3
author: Gerhard J. Woeginger
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1524972
zbMATH Keywords: graph algorithm
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: toughness of split graphs
MaRDI profile type: Publication
cites work: Recognizing tough graphs is NP-hard
cites work: Tough graphs and Hamiltonian circuits.
cites work: On submodular function minimization
cites work: Q4177589
cites work: Q3328583
cites work: Geometric algorithms and combinatorial optimization
cites work: Toughness, hamiltonicity and split graphs
full work available at URL: s0012-365x(98)00156-3
OpenAlex ID: W2047734515
description: scientific article; zbMATH DE number 1524972