Edge-cuts leaving components of order at least three
From MaRDI portal
Publication:1849951
DOI10.1016/S0012-365X(02)00385-0zbMath1017.05063MaRDI QIDQ1849951
Lutz Volkmann, Paul Bonsma, Nicola Ueffing
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Optimally restricted edge connected elementary Harary graphs, Vulnerability of super edge-connected networks, Edge fault tolerance of graphs with respect to super edge connectivity, Super restricted edge connectivity of regular edge-transitive graphs, \(k\)-restricted edge-connectivity in triangle-free graphs, On a kind of reliability analysis of networks, Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected, On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks, The \(k\)-restricted edge connectivity of balanced bipartite graphs, A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected, Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Diameter-girth sufficient conditions for optimal extraconnectivity in graphs, Extra edge connectivity and isoperimetric edge connectivity, K-restricted edge connectivity for some interconnection networks, Edge fault tolerance analysis of super \(k\)-restricted connected networks, Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs, A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\), Some remarks on \(\lambda _{p,q}\)-connectedness, Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2, On the existence of edge cuts leaving several large components, Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\), On the 3-restricted edge connectivity of permutation graphs, Minimally 3-restricted edge connected graphs, 3-restricted connectivity of graphs with given girth, Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected, The \(k\)-restricted edge connectivity of undirected Kautz graphs, Cuts leaving components of given minimum order, Note on the connectivity of line graphs, Sufficient conditions for restricted-edge-connectivity to be optimal, Super restricted edge connectivity of regular graphs, A proof of an inequality concerning \(k\)-restricted edge connectivity, Edge cuts leaving components of order at least \(m\), On edge cut of graphs leaving components of order at least five, Onm-restricted edge connectivity of undirected generalized De Bruijn graphs, Sufficient conditions for a graph to be λ k -optimal with given girth and diameter, Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
