A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected
Crossref DOI link: https://doi.org/10.1007/s10255-022-1057-9
Published Online: 2022-02-03
Published Print: 2022-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Yin, Jian-hua
Guo, Ji-yun
Text and Data Mining valid from 2022-01-01
Version of Record valid from 2022-01-01
Article History
Received: 12 January 2018
Accepted: 13 October 2020
First Online: 3 February 2022