On Harpers' Result Concerning the Bandwidths of Graphs

DOI10.1023/B:CMAJ.0000042378.90480.B1zbMATH Open1080.05530OpenAlexW2010346195MaRDI QIDQ3366636FDOQ3366636

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

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

zbMATH Keywords

graphsbandwidthexterior boundaryinterior boundary

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Optimal numberings and isoperimetric problems on graphs
• Computing the Bandwidth of Interval Graphs
• Complexity Results for Bandwidth Minimization
• The bandwidth problem for graphs and matrices—a survey
• The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
• Title not available (Why is that?)
• The bandwidth problem and operations on graphs
• Title not available (Why is that?)

Cited In (2)

• Harper-type lower bounds and the bandwidths of the compositions of graphs
• Title not available (Why is that?)

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)