| Minimum degree condition for a graph to be knitted | |
| Liu, Runrun; Rolek, Martin; Yu, Gexin* | |
| 刊名 | DISCRETE MATHEMATICS
 |
| 2019 | |
| 卷号 | 342期号:11页码:3225-3228 |
| 关键词 | Graph linkage Minimum degree Contraction-critical graphs Connectivity |
| ISSN号 | 0012-365X |
| DOI | 10.1016/j.disc.2019.06.038 |
| URL标识 | 查看原文 |
| WOS记录号 | WOS:000486358100028 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/5159877 |
| 专题 | 华中师范大学 |
| 作者单位 | 1.[Liu, Runrun 2.Yu, Gexin] Cent China Normal Univ, Sch Math & Stat, Wuhan, Hubei, Peoples R China. |
| 推荐引用方式 GB/T 7714 | Liu, Runrun,Rolek, Martin,Yu, Gexin*. Minimum degree condition for a graph to be knitted[J]. DISCRETE MATHEMATICS,2019,342(11):3225-3228. |
| APA | Liu, Runrun,Rolek, Martin,&Yu, Gexin*.(2019).Minimum degree condition for a graph to be knitted.DISCRETE MATHEMATICS,342(11),3225-3228. |
| MLA | Liu, Runrun,et al."Minimum degree condition for a graph to be knitted".DISCRETE MATHEMATICS 342.11(2019):3225-3228. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论