Toughness and the existence of \(k\)-factors. III
type: Item
instance of: scholarly article
title: Toughness and the existence of \(k\)-factors. III
zbMATH Open document ID: 0955.05085
DOI: 10.1016/S0012-365X(98)00059-4
author: Hikoe Enomoto
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1524947
zbMATH Keywords: \(k\)-factors
zbMATH Keywords: Chvátal's conjecture
zbMATH Keywords: toughness
MaRDI profile type: Publication
cites work: Q3852212
cites work: \((2,k)\)-factor-critical graphs and toughness
cites work: Q4350166
cites work: Tough graphs and Hamiltonian circuits.
cites work: Toughness and the existence ofk-factors
cites work: Toughness and the existence of k-factors. II
cites work: Toughness and the existence of \(k\)-factors. IV
cites work: Q4949854
cites work: Matching theory
full work available at URL: s0012-365x(98)00059-4
OpenAlex ID: W4213314029
Wikidata QID: Q126804749
description: scientific article; zbMATH DE number 1524947