The bandwidth of a tree with k leaves is at most

@article{Ando1996TheBO,
  title={The bandwidth of a tree with k leaves is at most},
  author={Kiyoshi Ando and Atsushi Kaneko and Severino V. Gervacio},
  journal={Discrete Mathematics},
  year={1996},
  volume={150},
  pages={403-406}
}

From This Paper

Topics from this paper.
4 Citations
0 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…