scientific article; zbMATH DE number 1749657

MaRDI QIDQ4532376zbMATH OpenFDO

Authors D. A. Dimarco

Publication date 7 August 2002

zbMATH Keywords

minimum degreevertex connectivity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2188466
• scientific article; zbMATH DE number 2188360
• Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree
• scientific article; zbMATH DE number 5844243
• An extremal problem on the connectivity of graphs

Cited in

(6)

• Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. III.
• Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. II
• scientific article; zbMATH DE number 5844243 (Why is no real title available?)
• Realizability of connected, separable, p-point, q-line graphs with prescribed minimum degree and line connectivity
• Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree
• Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree

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