A generalization of an edge-connectivity theorem of Chartrand

DOI10.1002/NET.20297MaRDI QIDQ3057106zbMATH OpenOpenAlexFDO

Authors F. T. Boesch, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo, Daniel J. 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

\(k\)-component edge connectivity\(k\)-component edge edge-failure set\(k\)-component edge-failure stateedge connectivityminimum degree

Mathematics Subject Classification ID

Connectivity (05C40) Combinatorial optimization (90C27)

Recommendations

• On the generalized (edge-)connectivity of graphs
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• A solution to a conjecture on the generalized connectivity of graphs
• scientific article; zbMATH DE number 812044
• On two generalized connectivities of graphs
• scientific article; zbMATH DE number 4023324
• Generalized edge theorem
• A generalization of Schönemann's theorem via a graph theoretic method
• A note on edge-connectivity of the Cartesian product of graphs
• On connectivities of edge-colored graphs

Cites work

• A Graph-Theoretic Approach to a Communications Problem
• Component order edge connectivity -- an introduction

Cited in

(8)

• On the -connectivity of a graph
• Generalized edge theorem
• Degree sequences and edge connectivity
• Sufficient degree conditions for k-edge-connectedness of a graph
• scientific article; zbMATH DE number 4023324 (Why is no real title available?)
• A generalization of Eagon–Reiner’s theorem and a characterization of bi-CM_t bipartite and chordal graphs
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• Connectivity keeping edges in graphs with large minimum degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057106)