The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\)
From MaRDI portal
Publication:1916130
DOI10.1016/0012-365X(96)00205-1zbMath0856.05090OpenAlexW2088019809MaRDI QIDQ1916130
Kiyoshi Ando, Severino V. Gervacio, Atsushi Kaneko
Publication date: 17 February 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(96)00205-1
Related Items
Cites Work