In a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-tough 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 1- or 2-factors. This solves a conjecture of Liu and Yu, affirmatively.
