A correction to Brelaz's modification of Brown's coloring algorithm
- 1 August 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (8) , 595-597
- https://doi.org/10.1145/358161.358171
Abstract
Brelaz's modification of Brown's exact coloring algorithm contains two errors as demonstrated in two examples. A correct version of the algorithm and a proof of the exactness are given. Finally, Brown's look-ahead rule is built into this algorithm.Keywords
This publication has 2 references indexed in Scilit:
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- Chromatic Scheduling and the Chromatic Number ProblemManagement Science, 1972