On upper bounds of bandwidths of trees

DOI10.1007/BF02013150zbMATH Open0832.05091MaRDI QIDQ1899015FDOQ1899015

Authors: Bing Yao, Jianfang Wang 

Publication date: 26 February 1996

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

zbMATH Keywords

treebandwidthpathsboundstars

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Complexity Results for Bandwidth Minimization
• The bandwidth problem for graphs and matrices—a survey
• Graphs with small bandwidth and cutwidth

Cited In (5)

• Some results on spanning trees
• Title not available (Why is that?)
• A Linear Algorithm for Topological Bandwidth in Degree-Three Trees
• The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\)
• Title not available (Why is that?)

This page was built for publication: On upper bounds of bandwidths of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899015)