Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142815 | Operations Research Letters | 2008 | 6 Pages |
Abstract
We generalize to the bandwidth coloring problem a classical theorem, discovered independently by Gallai, Roy and Vitaver, in the context of the graph coloring problem. Two proofs are given, a simple one and a more complex one that is based on a series of equivalent mathematical programming models.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Bernard Gendron, Alain Hertz, Patrick St-Louis,