On Harpers' Result Concerning the Bandwidths of Graphs

DOI10.1023/B:CMAJ.0000042378.90480.B1MaRDI QIDQ3366636zbMATH OpenOpenAlexFDO

Authors Kin Keung Poon

Publication date 14 February 2006

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/30869

zbMATH Keywords

graphsbandwidthexterior boundaryinterior boundary

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 434870
• scientific article; zbMATH DE number 279660
• scientific article; zbMATH DE number 894712
• scientific article; zbMATH DE number 3861212
• Harper-type lower bounds and the bandwidths of the compositions of graphs

Cites work

• scientific article; zbMATH DE number 1161364 (Why is no real title available?)
• scientific article; zbMATH DE number 3238649 (Why is no real title available?)
• Complexity Results for Bandwidth Minimization
• Computing the Bandwidth of Interval Graphs
• Graph theory with applications
• Optimal numberings and isoperimetric problems on graphs
• The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
• The bandwidth problem and operations on graphs
• The bandwidth problem for graphs and matrices—a survey

Cited in

(2)

• Harper-type lower bounds and the bandwidths of the compositions of graphs
• scientific article; zbMATH DE number 3861212 (Why is no real title available?)

This page was built for publication: On Harpers' Result Concerning the Bandwidths of Graphs

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