scientific article; zbMATH DE number 867714

MaRDI QIDQ4873831zbMATH OpenFDO

Authors Wayne Goddard, H. C. Swart

Publication date 22 April 1996

zbMATH Keywords

binding numbercharacterizationconnectivitycut-setextremal problemsintegritymaximal graphsNordhaus-Gaddumtoughness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• Extreme tenacity of graphs with given order and size
• An extremal problem in subconnectivity
• Extremal graphs with given stability number and connectivity. II
• An extremal problem on the connectivity of graphs
• scientific article; zbMATH DE number 3970793

Cited in

(12)

• A survey of integrity
• The complexity of recognizing tough cubic graphs
• Toughness in graphs -- a survey
• scientific article; zbMATH DE number 3910097 (Why is no real title available?)
• An extremal problem in subconnectivity
• A note on an extremal problem for group-connectivity
• Measures of vulnerability–the integrity family
• scientific article; zbMATH DE number 4119945 (Why is no real title available?)
• Extreme tenacity of graphs with given order and size
• An s-t connection problem with adaptability
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• Connection problems in mountains and monotonic allocation schemes.

This page was built for publication:

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