On the existence of edge cuts leaving several large components
From MaRDI portal
(Redirected from Publication:1024487)
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
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- A homology theory for spanning tress of a graph
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Conditional connectivity
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Cuts leaving components of given minimum order
- Edge cuts leaving components of order at least \(m\)
- Edge-cuts leaving components of order at least three
- On computing a conditional edge-connectivity of a graph
- On the extraconnectivity of graphs
- Restricted connectivity for three families of interconnection networks
- Super restricted edge-connectivity of vertex-transitive graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
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)
