Talk:Graph bandwidth

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Low	This article has been rated as Low-priority on the project's priority scale.

Computer science Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

I (Manfred W.; 2024-08-01) added chapter cyclically interval graphs. — Preceding unsigned comment added by 2A02:8071:8284:50A0:0:0:0:1530 (talk) 06:16, 1 August 2024 (UTC)[reply]

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)[reply]