Talk:Graph bandwidth

NP hardness of caterpillar trees
The paper that shows NP hardness for the approximation of caterpillar graphs is using a different definition (hair length 2) than the definition referenced in the linked article. The bandwidth problem for these graphs is easy to solve as it coincides with the local density bound $$\left \lceil ldb(G) \right \rceil$$ which is easy to compute for those caterpillar graphs. — Preceding unsigned comment added by 134.61.167.50 (talk) 14:03, 23 February 2017 (UTC)