Degree sequences and edge connectivity

DOI10.1007/s12188-016-0171-0zbMath1388.05040OpenAlexW2569644173MaRDI QIDQ1688269

Matthias Kriesell

Publication date: 5 January 2018

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12188-016-0171-0

zbMATH Keywords

degree sequenceedge connectivitygraphical partitionbigraphical sequence pairBondy-Chvátal type condition

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07)

Related Items (2)

On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences ⋮ Best monotone degree conditions for graph properties: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• On Hamilton's ideals
• The strongest monotone degree condition for \(n\)-connectedness of a graph
• Sufficient degree conditions fork-edge-connectedness of a graph
• Combinatorial Properties of Matrices of Zeros and Ones

This page was built for publication: Degree sequences and edge connectivity