A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected

DOI10.1007/S10255-022-1057-9zbMath1484.05041OpenAlexW4210593272MaRDI QIDQ2115234

Ji-Yun Guo, Jian Hua Yin

Publication date: 15 March 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1057-9

zbMATH Keywords

graphic sequenceforcibly \(k\)-edge-connected graphic sequencestrongest monotone degree condition

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• On Hamilton's ideals
• The strongest monotone degree condition for \(n\)-connectedness of a graph
• Sufficient degree conditions fork-edge-connectedness of a graph

This page was built for publication: A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected