A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected

Jian-hua YIN, Ji-yun GUO

应用数学学报(英文版) ›› 2022, Vol. 38 ›› Issue (1) : 223-228.

PDF(108 KB)
中国科学院数学与系统科学研究院期刊网
PDF(108 KB)
应用数学学报(英文版) ›› 2022, Vol. 38 ›› Issue (1) : 223-228. DOI: 10.1007/s10255-022-1057-9
ARTICLES

A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected

    Jian-hua YIN, Ji-yun GUO
作者信息 +

A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected

    Jian-hua YIN, Ji-yun GUO
Author information +
文章历史 +

本文亮点

{{article.keyPoints_cn}}

HeighLight

{{article.keyPoints_en}}

摘要

{{article.zhaiyao_cn}}

Abstract

{{article.zhaiyao_en}}

关键词

Key words

本文二维码

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
{{article.zuoZheCn_L}}. {{article.title_cn}}. {{journal.qiKanMingCheng_CN}}, 2022, 38(1): 223-228 https://doi.org/10.1007/s10255-022-1057-9
{{article.zuoZheEn_L}}. {{article.title_en}}. {{journal.qiKanMingCheng_EN}}, 2022, 38(1): 223-228 https://doi.org/10.1007/s10255-022-1057-9
中图分类号：

参考文献

原文顺序 | 文献年度倒序 | 文中引用次数倒序

参考文献

{{article.reference}}

基金

版权

{{article.copyrightStatement_cn}}
{{article.copyrightLicense_cn}}
PDF(108 KB)

Accesses

Citation

Detail
段落导航
相关文章

/

〈 〉