Using stable sets to bound the chromatic number

  • Authors:

  • D. de Werra;P. Hansen

  • Affiliations:

  • Institut de Mathématiques, École Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland;GERAD and Département des Méthodes Quantitatives de Gestion, École des Hautes Études Commerciales, Montréal, Canada

  • Venue:
  • Information Processing Letters
  • Year:
  • 2003

Quantified Score

Hi-index 0.89

Visualization

Abstract

A generalization of the Roy-Gallai theorem is presented: it is based on the existence in any oriented graph of a stable set S such that for any node w not in S there is an elementary path from some node of S to w. The bound obtained improves earlier results by Berge and by Li.