On the problem of bandsize

DOI10.1007/BF01788550zbMath0619.05028OpenAlexW2020046666MaRDI QIDQ1089353

Pavol Hell, Katherine Heinrich

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788550

zbMATH Keywords

radiusbandsizeedge-differencesvertex-numbering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

Decompositions into linear forests and difference labelings of graphs

Cites Work

• Unnamed Item
• On cross-bandwidth
• The bandwidth problem for graphs and matrices—a survey
• Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
• Complexity Results for Bandwidth Minimization
• Row-column permutation of sparse matrices
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: On the problem of bandsize