Cuts leaving components of given minimum order
From MaRDI portal
Publication:1773356
DOI10.1016/j.disc.2004.11.004zbMath1063.05079OpenAlexW2061604160MaRDI QIDQ1773356
Lutz Volkmann, Angelika Hellwig, Dieter Rautenbach
Publication date: 28 April 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.11.004
Related Items (15)
LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS ⋮ Note on the connectivity of line graphs ⋮ Linearly many faults in arrangement graphs ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ Conditional connectivity of recursive interconnection networks respect to embedding restriction ⋮ The existence and upper bound for two types of restricted connectivity ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ Linearly many faults in 2-tree-generated networks ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ Super \(p\)-restricted edge connectivity of line graphs ⋮ On the existence of edge cuts leaving several large components ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ Edge cuts leaving components of order at least \(m\)
Cites Work
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Claw-free graphs---a survey
- Edge-cuts leaving components of order at least three
- Conditional connectivity
- Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
- On restricted edge-connectivity of graphs.
This page was built for publication: Cuts leaving components of given minimum order
