A generalization of an edge-connectivity theorem of Chartrand

DOI10.1002/net.20297zbMath1207.05111OpenAlexW4238339368MaRDI QIDQ3057106

L. William Kazmierczak, J. T. Saccoman, Antonius Suhartomo, Charles L. Suffel, F. T. Boesch, Daniel Gross

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20297

zbMATH Keywords

minimum degreeedge connectivity\(k\)-component edge connectivity\(k\)-component edge edge-failure set\(k\)-component edge-failure state

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Connectivity (05C40)

Related Items (1)

Dr. Charles L. Suffel: Scholar, teacher, mentor, friend

Cites Work

• A Graph-Theoretic Approach to a Communications Problem
• Unnamed Item

This page was built for publication: A generalization of an edge-connectivity theorem of Chartrand