𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Toughness and the existence of k-factors. IV

✍ Scribed by Hikoe Enomoto; Mariko Hagita

Book ID
108316427
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
98 KB
Volume
216
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Toughness and the existence of k-factors
Toughness and the existence of k-factors
✍ Hikoe Enomoto; Bill Jackson; P. Katerinis; Akira Saito πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 317 KB πŸ‘ 1 views
Toughness and the existence of k-factors
Toughness and the existence of k-factors. III
✍ Hikoe Enomoto πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 312 KB

In a paper with the same title (Enomoto et al., 1985) we proved Chv&al's conjecture that ktough graphs have k-factors if they satisfy trivial necessary conditions. In this paper, we introduce a variation of toughness, and prove a stronger result for the existence of l-or 2-factors. This solves a con

Toughness of graphs and the existence of
Toughness of graphs and the existence of factors
✍ P. Katerinis πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 643 KB

## Theorem 2. Let G be a 2-tough graph. Then for any function f : V(G)+ { 1, 2) such that C xsvCcj f (x) in euen, G has an f-factor. Before stating the second main theorem of this paper it is necessary to make the following definition. Let G be a graph and let g and f be two integer-valued functi

Toughness, minimum degree, and the exist
Toughness, minimum degree, and the existence of 2-factors
✍ D. Bauer; E. Schmeichel πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 690 KB

## Abstract Degree conditions on the vertices of a __t__‐tough graph __G__(1 ≦ __t__ ≦ 2) that ensure the existence of a 2‐factor in __G__ are presented. These conditions are asymptotically best possible for every __t__ Ο΅ [1, 3/2] and for infinitely many __t__ Ο΅ [3/2, 2].