The connected cutset connectivity of a graph

DOI10.1016/0012-365X(88)90058-1MaRDI QIDQ1101465zbMATH OpenFDO

Authors Ortrud R. Oellermann

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(88)90058-1

zbMATH Keywords

edge-connectivityminimum degree

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Connectivity parameters of graphs
• scientific article; zbMATH DE number 3970793
• High connectivity keeping sets in \(n\)-connected graphs
• The existence and upper bound for two types of restricted connectivity
• scientific article; zbMATH DE number 5938876

Cites work

• A Graph-Theoretic Approach to a Communications Problem
• A sufficient condition for equality of edge-connectivity and minimum degree of a graph
• Critically n-Connected Graphs
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3497930 (Why is no real title available?)
• On graphs with equal edge-connectivity and minimum degree
• Results on the edge-connectivity of graphs

Cited in

(13)

• Minimal separating sets of maximum size
• Non-separable detachments of graphs
• Connectivity parameters of graphs
• Graphs with the smallest number of minimum cut sets
• scientific article; zbMATH DE number 5161490 (Why is no real title available?)
• scientific article; zbMATH DE number 3970793 (Why is no real title available?)
• scientific article; zbMATH DE number 759641 (Why is no real title available?)
• scientific article; zbMATH DE number 5938876 (Why is no real title available?)
• Computation in causal graphs
• The Set Connector Problem in Graphs
• Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
• The structure of 2-matching connected graphs
• High connectivity keeping sets in \(n\)-connected graphs

This page was built for publication: The connected cutset connectivity of a graph

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