Upper bound on the third edge-connectivity of graphs
From MaRDI portal
Publication:2574674
zbMath1085.05041MaRDI QIDQ2574674
Publication date: 30 November 2005
Published in: Science in China. Series A (Search for Journal in Brave)
Related Items (5)
Optimization problems of the third edge-connectivity of graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\) ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
This page was built for publication: Upper bound on the third edge-connectivity of graphs
