Toughness of graphs and \([2,b]\)-factors
type: Item
instance of: scholarly article
title: Toughness of graphs and \([2,b]\)-factors
zbMATH Open document ID: 0805.05061
DOI: 10.1007/BF02986653
author: Ciping Chen
published in: Graphs and Combinatorics
publication date: 1994-09-26T00:00:00Z
review text: It is proved that if a graph \(G\) has order at least 3, and \(b>2\), and for the toughness of \(G\) it holds \(\text{tough} (G) \geq 1 + {1 \over b}\), then \(G\) has a \([2,b]\)-factor. Moreover, it is shown that the thoughness condition in the above theorem cannot be replaced by \(\text{tough} (G) \geq 1 + {1 \over b} - \Theta\), where \(\Theta\) is any positive real number.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 644726
zbMATH Keywords: \([a,b]\)-factor
zbMATH Keywords: toughness
reviewed by: Martin Knor
MaRDI profile type: Publication
cites work: Q3097395
cites work: Q4024344
cites work: Tough graphs and Hamiltonian circuits.
cites work: Toughness and the existence ofk-factors
cites work: Q5572939
cites work: A simple existence criterion for \((g<f)\)-factors
cites work: Toughness of graphs and the existence of factors
Recommended article: Q3114954
Recommended article: Toughness of graphs and the existence of factors
Recommended article: Q4024344
Recommended article: \((2,k)\)-factor-critical graphs and toughness
Recommended article: Q4032983
Recommended article: Q4924917
Recommended article: On toughness and \((g,f)\)-factors in bipartite graphs
Recommended article: Two-tough graphs and \(f\)-factors with given properties
Recommended article: Bipartite toughness and \(k\)-factors in bipartite graphs
Recommended article: Q4500619
description: scientific article; zbMATH DE number 644726