Toughness and the existence of k-factors. IV

Discrete Mathematics

Volumn 216, Issue 1-3, 2000, Pages 111-120

  Enomoto, Hikoe ^a   Hagita, Mariko ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

Factor critical graphs; Regular factor; Toughness

Indexed keywords

EID: 0346108632     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00298-8     Document Type: Article

References (9)

1. M. Cai, O. Favaron, H. Li, (2, k)-Factor-critical graphs and toughness, Graphs Combin. 15 (1999) 137-142.
2. G. Chartrand, L. Lesniak, Graphs & Digraphs, 3rd Edition, Chapman & Hall, London, 1996.
3. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math. 5 (1973) 215-228.
4. H. Enomoto, B. Jackson, P. Katerinis, A. Saito, Toughness and the existence of k-factors, J. Graph Theory 9 (1985) 87-95.
5. H. Enomoto, Toughness and the existence of k-factors. II, Graphs Combin. 2 (1986) 37-42.
6. H. Enomoto, Toughness and the existence of k-factors. III, Discrete Math. 189 (1998) 277-282.
7. G. Liu, Q. Yu, k-Factors and extendability with prescribed components, preprint.
8. M. Shi, X. Yuan, M. Cai, O. Favaron, (3, k)-Factor-critical graphs and toughness, Graphs Combin., in press.
9. W.T. Tutte, The factors of graphs, Canad. J. Math. 4 (1952) 314-328.