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

DOI10.1007/S10255-022-1057-9MaRDI QIDQ2115234zbMATH OpenOpenAlexFDO

Authors Jian-Hua Yin, Ji-Yun Guo

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

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

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40)

Recommendations

• On forcibly connected graphic sequences
• Degree sequences and the existence of k-factors
• Degree sequences and edge connectivity
• An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
• On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences

Cites work

• scientific article; zbMATH DE number 3293646 (Why is no real title available?)
• On Hamilton's ideals
• Sufficient degree conditions for k-edge-connectedness of a graph
• The strongest monotone degree condition for \(n\)-connectedness of a graph

Cited in

(5)

• On forcibly connected graphic sequences
• On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences
• Sufficient degree conditions for k-edge-connectedness of a graph
• Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results
• On forcibly k-connected uniform hypergraphic sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115234)