On the existence of edge cuts leaving several large components

DOI10.1016/j.disc.2008.02.014zbMath1189.05091OpenAlexW2092579649MaRDI QIDQ1024487

Dieter Rautenbach, Lutz Volkmann

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00009397

zbMATH Keywords

edge connectivityrestricted edge cut

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

Maximally edge-connected and vertex-connected graphs and digraphs: A survey

Cites Work

• Unnamed Item
• On computing a conditional edge-connectivity of a graph
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Super restricted edge-connectivity of vertex-transitive graphs
• Cuts leaving components of given minimum order
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• On the extraconnectivity of graphs
• Restricted connectivity for three families of interconnection networks
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Conditional connectivity
• A homology theory for spanning tress of a graph

This page was built for publication: On the existence of edge cuts leaving several large components