On upper bounds of bandwidths of trees

DOI10.1007/BF02013150zbMath0832.05091MaRDI QIDQ1899015

Bing Yao, Jian-fang Wang

Publication date: 26 February 1996

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

starstreepathsbandwidthbound

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Some results on spanning trees

Cites Work

• Unnamed Item
• Graphs with small bandwidth and cutwidth
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization