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

DOI10.1016/J.ORL.2007.09.004zbMath1152.05329OpenAlexW1968194949MaRDI QIDQ943796

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

mathematical programminggraph coloring problembandwidth coloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variations on the Roy-Gallai theorem
• Acyclic orientations of a graph and the chromatic and independence numbers
• A note on the Gallai-Roy-Vitaver theorem
• Nombre chromatique et plus longs chemins d'un graphe

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