The bandwidth of a tree with k leaves is at most k2

Authors:
Kiyoshi Ando;Atsusi Kaneko;Severino Gervacio
Affiliations:
-;-;-
Venue:
Discrete Mathematics - Special issue: selected papers in honour of Paul Erdo&huml;s on the occasion of his 80th birthday
Year:
1996

Citing 0
Cited 3

On the Domination Search Number

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On the domination search number

Discrete Applied Mathematics
Approximating bandwidth by mixing layouts of interval graphs

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract