(3,k)-Factor-critical graphs and toughness
文献类型：期刊论文
| 作者 | Shi, MY; Yuan, YD; Cai, MC; Favaron, O |
| 刊名 | GRAPHS AND COMBINATORICS
 |
| 出版日期 | 1999 |
| 卷号 | 15期号:4页码:463-471 |
| ISSN号 | 0911-0119 |
| 英文摘要 | A graph is (r, k)-factor-critical if the removal of any set of k vertices results in a graph with an r-factor (i.e. an r-regular spanning subgraph). Let t(G) denote the toughness of graph G. In this paper, we show that if t(G) greater than or equal to 4, then G is (3, k)-factor-critical for every non-negative integer k such that n + k even, k < 2t(G) - 2 and k less than or equal to n - 7. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000084614000008 |
| 出版者 | SPRINGER VERLAG |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/14747]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Shi, MY |
| 作者单位 | 1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 2.Univ Paris Sud, LRI, CNRS, URA 410, F-91405 Orsay, France |
| 推荐引用方式 GB/T 7714 | Shi, MY,Yuan, YD,Cai, MC,et al. (3,k)-Factor-critical graphs and toughness[J]. GRAPHS AND COMBINATORICS,1999,15(4):463-471. |
| APA | Shi, MY,Yuan, YD,Cai, MC,&Favaron, O.(1999).(3,k)-Factor-critical graphs and toughness.GRAPHS AND COMBINATORICS,15(4),463-471. |
| MLA | Shi, MY,et al."(3,k)-Factor-critical graphs and toughness".GRAPHS AND COMBINATORICS 15.4(1999):463-471. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。