The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars

DOI10.1016/S0304-0208(08)72457-5MaRDI QIDQ3956995zbMATH OpenOpenAlexFDO

Authors Maciej M. Sysło, J. Zak

Publication date 1982

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)72457-5

zbMATH Keywords

bandwidthcaterpillarsvertex-labellingefficient labelling procedureorder and diameter of subtrees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Cited in

(8)

• The bandwidth problem and operations on graphs
• Bandwidth of the composition of two graphs.
• Bandwidth of trees of diameter at most 4
• On Harpers' Result Concerning the Bandwidths of Graphs
• Bandwidth and density for block graphs
• Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}
• Bandwidth Minimization: An approximation algorithm for caterpillars
• Two models of two-dimensional bandwidth problems

This page was built for publication: The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars

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