Edge-cuts leaving components of order at least three
From MaRDI portal
Publication:1849951
DOI10.1016/S0012-365X(02)00385-0zbMath1017.05063MaRDI QIDQ1849951
Nicola Ueffing, Paul Bonsma, Lutz Volkmann
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ On edge cut of graphs leaving components of order at least five ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Note on the connectivity of line graphs ⋮ Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal ⋮ Bounds for the Super Extra Edge Connectivity of Graphs ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ Vulnerability of super edge-connected networks ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ Restricted arc-connectivity of unidirectional star graphs ⋮ 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 ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected ⋮ A sufficient condition for graphs to be \(\lambda_k\)-optimal ⋮ The edge connectivity of expanded \(k\)-ary \(n\)-cubes ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter-girth sufficient conditions for optimal extraconnectivity in graphs ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs ⋮ Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ Extra edge connectivity and isoperimetric edge connectivity ⋮ K-restricted edge connectivity for some interconnection networks ⋮ On the complexity of computing the \(k\)-restricted edge-connectivity of a graph ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Vulnerability of super extra edge-connected graphs ⋮ A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\) ⋮ Super restricted edge connectivity of regular graphs ⋮ Cuts leaving components of given minimum order ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ Unnamed Item ⋮ Reliability analysis of godan graphs ⋮ 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 Complexity of Computing the k-restricted Edge-connectivity of a Graph ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Minimally 3-restricted edge connected graphs ⋮ A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected ⋮ 3-restricted connectivity of graphs with given girth ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected ⋮ The \(k\)-restricted edge connectivity of undirected Kautz graphs ⋮ A proof of an inequality concerning \(k\)-restricted edge connectivity ⋮ Edge cuts leaving components of order at least \(m\) ⋮ On the conditional edge connectivity of double-orbit graphs ⋮ Onm-restricted edge connectivity of undirected generalized De Bruijn graphs ⋮ Arc fault tolerance of Kautz digraphs
