scientific article; zbMATH DE number 4158656

MaRDI QIDQ3487419zbMATH OpenFDO

Authors Shu-Shih Y. Wu, M. Cozzens

Publication date 1990

zbMATH Keywords

critically m- neighbour-connected graphsminimum sizeneighbour-connectivitynumber of edgesupper bounds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 3880752
• On Minimum Critically n-Edge-Connected Graphs
• scientific article; zbMATH DE number 867625
• scientific article; zbMATH DE number 3896974
• Critically (k,k)-connected graphs

Cited in

(7)

• On minimal neighbourhood-connected graphs
• Neighbor-connectivity of pancake networks and burnt pancake networks
• Neighbor Isolated Tenacity of Graphs
• The Size of a Minimum Critically m-Neighbor-Scattered Graph
• scientific article; zbMATH DE number 3979100 (Why is no real title available?)
• scientific article; zbMATH DE number 867625 (Why is no real title available?)
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time

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 Q3487419)