(3, k)-factor-critical graphs and toughness

Graphs and Combinatorics

Volumn 15, Issue 4, 1999, Pages 463-471

  Shi, Minyong ^a   Yuan, Xudong ^a,c   Cai, Mao Cheng ^a   Favaron, Odile ^b  

^a INSTITUTE OF SYSTEMS SCIENCE   (China)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c GUANGXI NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 19544390530     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730050053     Document Type: Article

References (8)

1. Cai, M., Favaron O., Li, H.: (2, k)-factor-critical graphs and toughness, Graph. Comb. 15(2), 137-142
2. Enomoto, H.: Toughness and the existence of k-factor (III), Discrete Math. 189, 277-282 (1998)
3. Enomoto, H., Hagia, M.: Toughness and the existence of k-factor (IV), submitted
4. Enomoto, H., Jackson, B., Katerinis P., Saito, A.: Toughness and the existence of k-factors, J. Graph Theory 9, 87-95 (1985)
5. Favaron, O.: On k-factor-critical graphs, Discuss. Math. Graph Theory 16, 41-51 (1996)
6. Liu G., Yu, Q.: k-factors and extendability with prescribed components, submitted
7. Tutte, W.T.: The factorization of linear graphs, J. Lond. Math. Soc. 22, 107-111 (1947)
8. Tutte, W.T.: The factors of graphs, Can. J. Math. 4, 314-328 (1952)