On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem

Authors:
Bernard Gendron;Alain Hertz;Patrick St-Louis
Affiliations:
Département d'informatique et de recherche opérationnelle, Université de Montréal, Canada and CIRRELT, Canada;Département de mathématiques et de génie industriel, ícole Polytechnique de Montréal, Canada and GERAD, Canada;GIRO Inc., Canada
Venue:
Operations Research Letters
Year:
2008

Citing 3
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A note on the Gallai---Roy---Vitaver theorem

Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.