3-restricted edge cut of graphs

MaRDI QIDQ854600zbMATH OpenFDO

Authors Jianping Ou, Fuji Zhang

Publication date 6 December 2006

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Connectivity (05C40)

Review text

A 3-restricted edge cut is an edge cut that separates a connetced graph into a disconnected one with components having order a least 3. The authors characterized graphs which have a 3-restricted edge cut. Reviewers remark: This characterization is well known. It can be found in the paper [\textit{P. Bonsma, N. Ueffing} and \textit{L. Volkmann}, Discrete Math. 256, 431--439 (2002; Zbl 1017.05063)].

Recommendations

• Minimally 3-restricted edge connected graphs
• Edge cuts leaving components of order at least \(m\)
• scientific article; zbMATH DE number 2108137
• m-restricted edge cut of graphs with 4 circumference and 3 free
• A proof of an inequality concerning \(k\)-restricted edge connectivity

Cited in

(8)

• Super cyclically edge-connected vertex-transitive graphs of girth at least 5
• Edge cuts leaving components of order at least \(m\)
• On edge cut of graphs leaving components of order at least five
• m-restricted edge cut of graphs with 4 circumference and 3 free
• scientific article; zbMATH DE number 512927 (Why is no real title available?)
• On computing of a conditional edge connectivity of alternating group network
• scientific article; zbMATH DE number 2108137 (Why is no real title available?)
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey

This page was built for publication: 3-restricted edge cut of graphs

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