scientific article; zbMATH DE number 434870

MaRDI QIDQ3139720zbMATHFDO

Authors David R. Hare, William R. Hare

Publication date 11 November 1993

zbMATH Keywords

bandwidthHarper's bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Bounding the bandwidths for graphs
• scientific article; zbMATH DE number 1382303
• scientific article; zbMATH DE number 3859182
• scientific article; zbMATH DE number 894712
• On the size of graphs of a given bandwidth
• scientific article; zbMATH DE number 812088
• scientific article; zbMATH DE number 3861212
• On the bandwidth of the Kneser graph
• On bandwidth sums of graphs
• The bandwidth theorem in sparse graphs

Cited in

(6)

• scientific article; zbMATH DE number 3861212 (Why is no real title available?)
• Harper-type lower bounds and the bandwidths of the compositions of graphs
• scientific article; zbMATH DE number 279660 (Why is no real title available?)
• scientific article; zbMATH DE number 812088 (Why is no real title available?)
• On Harpers' Result Concerning the Bandwidths of Graphs
• On the size of graphs of a given bandwidth

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