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

DOI10.1016/J.ORL.2007.09.004MaRDI QIDQ943796zbMATH OpenOpenAlexFDO

Authors Bernard Gendron, Alain Hertz, Patrick St-Louis

Publication date 10 September 2008

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2007.09.004

zbMATH Keywords

bandwidth coloring problemgraph coloring problemmathematical programming

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Variations on the Roy-Gallai theorem
• A note on the Gallai-Roy-Vitaver theorem
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Using stable sets to bound the chromatic number
• Some generalizations of theorems on vertex coloring

Cites work

• A note on the Gallai-Roy-Vitaver theorem
• Acyclic orientations of a graph and the chromatic and independence numbers
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• Nombre chromatique et plus longs chemins d'un graphe
• Variations on the Roy-Gallai theorem

Cited in

(3)

• Using stable sets to bound the chromatic number
• A note on the Gallai-Roy-Vitaver theorem
• Variations on the Roy-Gallai theorem

This page was built for publication: On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943796)