Characterization of _3,q-connected graphs

MaRDI QIDQ3017192zbMATH OpenFDO

Authors Haiqiang Xiao, Zhao Zhang

Publication date 19 July 2011

zbMATH Keywords

connected graphrestricted edge connectivityspanning tree

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Recommendations

• Some remarks on \(\lambda _{p,q}\)-connectedness
• Edge-cuts leaving components of order at least three
• Minimally 3-restricted edge connected graphs
• Sufficient conditions for \(\lambda_3\)-optimality of triangle-free graphs
• The minimal size of a graph with given generalized 3-edge-connectivity.

Cited in

(4)

• Edge-cuts leaving components of order at least three
• scientific article; zbMATH DE number 1382419 (Why is no real title available?)
• scientific article; zbMATH DE number 5869 (Why is no real title available?)
• Some remarks on \(\lambda _{p,q}\)-connectedness

This page was built for publication: Characterization of \(\lambda_{3,q}\)-connected graphs

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