The connected cutset connectivity of a graph

DOI10.1016/0012-365X(88)90058-1zbMATH Open0643.05044MaRDI QIDQ1101465FDOQ1101465

Authors: Ortrud R. Oellermann 

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreeedge-connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Results on the edge-connectivity of graphs
• A Graph-Theoretic Approach to a Communications Problem
• Critically n-Connected Graphs
• On graphs with equal edge-connectivity and minimum degree
• A sufficient condition for equality of edge-connectivity and minimum degree of a graph

Cited In (12)

• Title not available (Why is that?)
• Graphs with the smallest number of minimum cut sets
• Connectivity parameters of graphs
• High connectivity keeping sets in \(n\)-connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Set Connector Problem in Graphs
• Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
• Non-separable detachments of graphs
• Minimal separating sets of maximum size
• Computation in causal graphs
• Title not available (Why is that?)

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)