Bounds on the convex label number of trees

DOI10.1007/BF02579299zbMath0646.05021OpenAlexW2046254362MaRDI QIDQ1103629

Maria M. Klawe, Alice Wong, Marshall W. Bern

Publication date: 1987

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579299

zbMATH Keywords

treeconvex labelling

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Cutwidth and the Topological Bandwidth of a Tree
• Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
• A polynomial algorithm for the min-cut linear arrangement of trees
• Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
• Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
• On Additive Bases and Harmonious Graphs
• Complexity Results for Bandwidth Minimization
• Determining the Chromatic Number of a Graph

This page was built for publication: Bounds on the convex label number of trees