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

Graphs and Combinatorics

Volumn 15, Issue 2, 1999, Pages 137-142

  Cai, Mao Cheng ^a   Favaron, Odile ^b   Li, Hao ^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)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347958277     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730050035     Document Type: Article

References (8)

1. Enomoto, H., Jackson, B., Katerinis P., and Saito, A.: Toughness and the existence of k-factors, J. Graph Theory 9, 87-95 (1985)
2. Enomoto, H.: Toughness and the existence of k-factors III, Discrete Math. 189, 277-282 (1998)
3. Favaron, O.: On k-factor-critical graphs, Discussiones Mathematicae-Graph Theory 16, 41-51, (1996)
4. Liu G., Yu, Q.: k-factors and extendability with prescribed components, submitted
5. Shi, M., Yuan, X., and Cai, M.: (3,k)-Factor-critical graphs and toughness, submitted
6. Tutte, W.T.: The factorization of linear graphs, J. London Math. Soc. 22, 107-111, (1947)
7. Tutte, W.T.: The factors of graphs, Canad. J. Math. 4, 314-328, (1952)
8. Yuan, X., Shi, M., and Cai, M.: (4,k)-Factor-critical graphs and toughness, in preparation