The \(k\)-restricted edge connectivity of balanced bipartite graphs
From MaRDI portal
Publication:659684
DOI10.1007/s00373-010-0966-1zbMath1235.05082MaRDI QIDQ659684
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0966-1
\(k\)-restricted edge connectivity; edge connectivity; balanced bipartite graphs; degree sum conditions
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C40: Connectivity
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- On the extraconnectivity of graphs
- A bound on 4-restricted edge connectivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
