Toughness and the existence of k-factors. III

Discrete Mathematics

Volumn 189, Issue 1-3, 1998, Pages 277-282

  Enomoto, Hikoe ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043286523     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00059-4     Document Type: Article

References (9)

1. B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.
2. M-c. Cai, O. Favaron, H. Li, (2,k)-factor critical graphs and toughness, Graphs Combin., to appear.
3. G. Chartrand, L. Lesniak, Graphs & Digraphs, 3rd ed., Chapman & Hall, London, 1996.
4. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math. 5 (1973) 215-228.
5. H. Enomoto, B. Jackson, P. Katerinis, A. Saito, Toughness and the existence of k-factors, J. Graph Theory 9 (1985) 87-95.
6. H. Enomoto, Toughness and the existence of k-factors. II, Graphs Combin. 2 (1986) 37-42.
7. H. Enomoto, Toughness and the existence of k-factors. IV, preprint.
8. G. Liu, Q. Yu, k-factors and extendability with prescribed components, preprint.
9. L. Lovász, M.D. Plummer, Matching Theory, North-Holland, Amsterdam, 1986.