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

Jian-hua YIN, Ji-yun GUO

Acta Mathematicae Applicatae Sinica(English Series) ›› 2022, Vol. 38 ›› Issue (1) : 223-228.

PDF(108 KB)
中国科学院数学与系统科学研究院期刊网
PDF(108 KB)
Acta Mathematicae Applicatae Sinica(English Series) ›› 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

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Acta Mathematicae Applicatae Sinica(English Series), 2022, 38(1): 223-228 https://doi.org/10.1007/s10255-022-1057-9

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(108 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉