On the existence of edge cuts leaving several large components
From MaRDI portal
Publication:1024487
DOI10.1016/J.DISC.2008.02.014zbMATH Open1189.05091OpenAlexW2092579649MaRDI QIDQ1024487FDOQ1024487
Authors: 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
Recommendations
- Edge cuts leaving components of order at least \(m\)
- Edge-cuts leaving components of order at least three
- On edge cut of graphs leaving components of order at least five
- On Connected Components with Many Edges
- Cut-edges and the independence number
- On maximum edge cuts of connected digraphs
- Maximal cuts in arbitrary dimension
- On graphs with cut vertices and cut edges
- On disconnected cuts and separators
- On the structure of vertex cuts separating the ends of a graph
Cites Work
- On the extraconnectivity of graphs
- Restricted connectivity for three families of interconnection networks
- Conditional connectivity
- On computing a conditional edge-connectivity of a graph
- Super restricted edge-connectivity of vertex-transitive graphs
- Title not available (Why is that?)
- A homology theory for spanning tress of a graph
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Cuts leaving components of given minimum order
Cited In (1)
This page was built for publication: On the existence of edge cuts leaving several large components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024487)
